/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 15:44:16,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 15:44:16,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 15:44:16,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 15:44:16,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 15:44:16,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 15:44:16,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 15:44:16,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 15:44:16,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 15:44:16,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 15:44:16,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 15:44:16,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 15:44:16,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 15:44:16,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 15:44:16,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 15:44:16,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 15:44:16,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 15:44:16,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 15:44:16,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 15:44:16,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 15:44:16,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 15:44:16,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 15:44:16,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 15:44:16,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 15:44:16,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 15:44:16,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 15:44:16,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 15:44:16,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 15:44:16,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 15:44:16,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 15:44:16,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 15:44:16,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 15:44:16,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 15:44:16,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 15:44:16,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 15:44:16,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 15:44:16,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 15:44:16,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 15:44:16,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 15:44:16,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 15:44:16,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 15:44:16,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-14 15:44:16,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 15:44:16,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 15:44:16,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-14 15:44:16,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-14 15:44:16,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-14 15:44:16,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-14 15:44:16,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-14 15:44:16,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-14 15:44:16,601 INFO L138 SettingsManager]: * Use SBE=true [2022-02-14 15:44:16,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 15:44:16,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 15:44:16,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 15:44:16,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 15:44:16,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 15:44:16,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 15:44:16,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 15:44:16,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 15:44:16,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 15:44:16,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 15:44:16,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 15:44:16,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-14 15:44:16,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-14 15:44:16,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 15:44:16,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-14 15:44:16,605 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-14 15:44:16,605 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-14 15:44:16,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-14 15:44:16,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-14 15:44:16,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 15:44:16,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 15:44:16,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 15:44:16,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 15:44:16,852 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 15:44:16,852 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-02-14 15:44:16,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b1a5a0a/65cf4548195740ccbb7e21ec9b75197a/FLAG987cbf3c9 [2022-02-14 15:44:17,288 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 15:44:17,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-02-14 15:44:17,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b1a5a0a/65cf4548195740ccbb7e21ec9b75197a/FLAG987cbf3c9 [2022-02-14 15:44:17,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b1a5a0a/65cf4548195740ccbb7e21ec9b75197a [2022-02-14 15:44:17,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 15:44:17,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-14 15:44:17,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 15:44:17,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 15:44:17,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 15:44:17,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686248c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17, skipping insertion in model container [2022-02-14 15:44:17,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 15:44:17,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 15:44:17,525 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-02-14 15:44:17,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[1636,1649] [2022-02-14 15:44:17,529 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-02-14 15:44:17,531 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-02-14 15:44:17,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-02-14 15:44:17,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-02-14 15:44:17,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[3116,3129] [2022-02-14 15:44:17,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[3386,3399] [2022-02-14 15:44:17,535 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-02-14 15:44:17,537 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-02-14 15:44:17,537 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-02-14 15:44:17,539 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-02-14 15:44:17,540 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-02-14 15:44:17,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[5421,5434] [2022-02-14 15:44:17,542 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-02-14 15:44:17,542 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-02-14 15:44:17,543 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-02-14 15:44:17,544 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-02-14 15:44:17,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 15:44:17,551 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 15:44:17,560 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-02-14 15:44:17,562 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-02-14 15:44:17,562 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-02-14 15:44:17,564 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-02-14 15:44:17,564 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-02-14 15:44:17,565 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-02-14 15:44:17,566 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-02-14 15:44:17,567 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-02-14 15:44:17,567 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-02-14 15:44:17,569 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-02-14 15:44:17,569 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-02-14 15:44:17,570 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-02-14 15:44:17,571 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-02-14 15:44:17,572 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-02-14 15:44:17,573 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-02-14 15:44:17,573 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-02-14 15:44:17,574 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-02-14 15:44:17,575 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-02-14 15:44:17,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 15:44:17,584 INFO L208 MainTranslator]: Completed translation [2022-02-14 15:44:17,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17 WrapperNode [2022-02-14 15:44:17,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 15:44:17,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 15:44:17,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 15:44:17,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 15:44:17,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 15:44:17,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 15:44:17,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 15:44:17,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 15:44:17,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (1/1) ... [2022-02-14 15:44:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 15:44:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 15:44:17,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-14 15:44:17,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-14 15:44:17,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 15:44:17,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 15:44:17,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 15:44:17,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-14 15:44:17,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 15:44:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-14 15:44:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 15:44:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 15:44:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 15:44:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 15:44:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 15:44:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 15:44:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 15:44:17,789 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 15:44:17,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 15:44:18,035 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 15:44:18,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 15:44:18,040 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-14 15:44:18,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:44:18 BoogieIcfgContainer [2022-02-14 15:44:18,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 15:44:18,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 15:44:18,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 15:44:18,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 15:44:18,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 03:44:17" (1/3) ... [2022-02-14 15:44:18,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bac2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 03:44:18, skipping insertion in model container [2022-02-14 15:44:18,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:44:17" (2/3) ... [2022-02-14 15:44:18,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bac2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 03:44:18, skipping insertion in model container [2022-02-14 15:44:18,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:44:18" (3/3) ... [2022-02-14 15:44:18,059 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-02-14 15:44:18,062 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-14 15:44:18,063 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-14 15:44:18,106 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 15:44:18,113 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 15:44:18,113 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-14 15:44:18,127 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-02-14 15:44:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-14 15:44:18,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:18,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:18,136 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-02-14 15:44:18,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:18,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679864211] [2022-02-14 15:44:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:18,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:18,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:18,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:18,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679864211] [2022-02-14 15:44:18,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679864211] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:18,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:18,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:18,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002831048] [2022-02-14 15:44:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:18,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:18,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:18,343 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-02-14 15:44:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:18,563 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-02-14 15:44:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-14 15:44:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:18,572 INFO L225 Difference]: With dead ends: 129 [2022-02-14 15:44:18,572 INFO L226 Difference]: Without dead ends: 111 [2022-02-14 15:44:18,575 INFO L932 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-02-14 15:44:18,579 INFO L933 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.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:18,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-14 15:44:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-02-14 15:44:18,612 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-02-14 15:44:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-02-14 15:44:18,616 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-02-14 15:44:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:18,616 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-02-14 15:44:18,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-02-14 15:44:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-14 15:44:18,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:18,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:18,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 15:44:18,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-02-14 15:44:18,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:18,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139856634] [2022-02-14 15:44:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:18,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:18,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139856634] [2022-02-14 15:44:18,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139856634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:18,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:18,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:18,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849632999] [2022-02-14 15:44:18,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:18,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:18,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:18,740 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-02-14 15:44:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:18,934 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-14 15:44:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-14 15:44:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:18,936 INFO L225 Difference]: With dead ends: 111 [2022-02-14 15:44:18,936 INFO L226 Difference]: Without dead ends: 109 [2022-02-14 15:44:18,936 INFO L932 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-02-14 15:44:18,937 INFO L933 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.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:18,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-14 15:44:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-02-14 15:44:18,941 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-02-14 15:44:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-14 15:44:18,942 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-02-14 15:44:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:18,942 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-14 15:44:18,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-14 15:44:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-14 15:44:18,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:18,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:18,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 15:44:18,943 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-02-14 15:44:18,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:18,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376237021] [2022-02-14 15:44:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:18,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376237021] [2022-02-14 15:44:19,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376237021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:19,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607929654] [2022-02-14 15:44:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:19,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:19,018 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-02-14 15:44:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:19,132 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-14 15:44:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-14 15:44:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:19,137 INFO L225 Difference]: With dead ends: 73 [2022-02-14 15:44:19,137 INFO L226 Difference]: Without dead ends: 71 [2022-02-14 15:44:19,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:19,139 INFO L933 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-02-14 15:44:19,140 INFO L934 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-02-14 15:44:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-14 15:44:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-02-14 15:44:19,151 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-02-14 15:44:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-02-14 15:44:19,153 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-02-14 15:44:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:19,153 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-02-14 15:44:19,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-14 15:44:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-14 15:44:19,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:19,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:19,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-14 15:44:19,156 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-02-14 15:44:19,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:19,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343863750] [2022-02-14 15:44:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343863750] [2022-02-14 15:44:19,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343863750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:19,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305928772] [2022-02-14 15:44:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:19,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:19,222 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-02-14 15:44:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:19,326 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-14 15:44:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-14 15:44:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:19,329 INFO L225 Difference]: With dead ends: 71 [2022-02-14 15:44:19,329 INFO L226 Difference]: Without dead ends: 69 [2022-02-14 15:44:19,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:19,330 INFO L933 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-02-14 15:44:19,330 INFO L934 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-02-14 15:44:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-14 15:44:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-14 15:44:19,333 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-02-14 15:44:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-02-14 15:44:19,334 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-02-14 15:44:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:19,334 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-02-14 15:44:19,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-14 15:44:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:19,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:19,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:19,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-14 15:44:19,335 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-02-14 15:44:19,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:19,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753964573] [2022-02-14 15:44:19,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753964573] [2022-02-14 15:44:19,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753964573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:19,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140088339] [2022-02-14 15:44:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:19,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:19,377 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-02-14 15:44:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:19,451 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-14 15:44:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:19,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-14 15:44:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:19,452 INFO L225 Difference]: With dead ends: 69 [2022-02-14 15:44:19,452 INFO L226 Difference]: Without dead ends: 65 [2022-02-14 15:44:19,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:19,453 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-14 15:44:19,453 INFO L934 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-02-14 15:44:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-14 15:44:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-02-14 15:44:19,456 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-02-14 15:44:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-02-14 15:44:19,457 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-02-14 15:44:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:19,457 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-02-14 15:44:19,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-02-14 15:44:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:19,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:19,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:19,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-14 15:44:19,458 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-02-14 15:44:19,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:19,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889046028] [2022-02-14 15:44:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889046028] [2022-02-14 15:44:19,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889046028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:19,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128947732] [2022-02-14 15:44:19,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:19,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:19,500 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-02-14 15:44:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:19,644 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-02-14 15:44:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-14 15:44:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:19,645 INFO L225 Difference]: With dead ends: 108 [2022-02-14 15:44:19,645 INFO L226 Difference]: Without dead ends: 106 [2022-02-14 15:44:19,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:19,646 INFO L933 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-02-14 15:44:19,646 INFO L934 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-02-14 15:44:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-14 15:44:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-02-14 15:44:19,649 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-02-14 15:44:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-02-14 15:44:19,649 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-02-14 15:44:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:19,649 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-02-14 15:44:19,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-14 15:44:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:19,650 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:19,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:19,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-14 15:44:19,650 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-02-14 15:44:19,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:19,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645287809] [2022-02-14 15:44:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645287809] [2022-02-14 15:44:19,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645287809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:19,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241822299] [2022-02-14 15:44:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:19,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:19,688 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-02-14 15:44:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:19,807 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-02-14 15:44:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:19,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-14 15:44:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:19,808 INFO L225 Difference]: With dead ends: 93 [2022-02-14 15:44:19,808 INFO L226 Difference]: Without dead ends: 91 [2022-02-14 15:44:19,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:19,809 INFO L933 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-02-14 15:44:19,809 INFO L934 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-02-14 15:44:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-14 15:44:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-02-14 15:44:19,812 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-02-14 15:44:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-14 15:44:19,812 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-02-14 15:44:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:19,812 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-14 15:44:19,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-14 15:44:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 15:44:19,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:19,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:19,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-14 15:44:19,813 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-02-14 15:44:19,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:19,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369557891] [2022-02-14 15:44:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369557891] [2022-02-14 15:44:19,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369557891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:19,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354723377] [2022-02-14 15:44:19,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:19,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:19,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:19,847 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-02-14 15:44:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:19,916 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-14 15:44:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:19,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-14 15:44:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:19,916 INFO L225 Difference]: With dead ends: 61 [2022-02-14 15:44:19,916 INFO L226 Difference]: Without dead ends: 57 [2022-02-14 15:44:19,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:19,917 INFO L933 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.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:19,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-14 15:44:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-02-14 15:44:19,920 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-02-14 15:44:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-02-14 15:44:19,920 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-02-14 15:44:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:19,920 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-02-14 15:44:19,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-14 15:44:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:19,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:19,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:19,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-14 15:44:19,921 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:19,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-02-14 15:44:19,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:19,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204573537] [2022-02-14 15:44:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:19,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:19,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204573537] [2022-02-14 15:44:19,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204573537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:19,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:19,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:19,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652476399] [2022-02-14 15:44:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:19,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:19,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:19,955 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-02-14 15:44:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:20,044 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-14 15:44:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 15:44:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:20,045 INFO L225 Difference]: With dead ends: 74 [2022-02-14 15:44:20,045 INFO L226 Difference]: Without dead ends: 72 [2022-02-14 15:44:20,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:20,046 INFO L933 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-02-14 15:44:20,046 INFO L934 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-02-14 15:44:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-14 15:44:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-02-14 15:44:20,048 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-02-14 15:44:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-02-14 15:44:20,049 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-02-14 15:44:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:20,049 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-02-14 15:44:20,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-14 15:44:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:20,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:20,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:20,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-14 15:44:20,050 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-02-14 15:44:20,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:20,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693831829] [2022-02-14 15:44:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:20,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:20,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693831829] [2022-02-14 15:44:20,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693831829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:20,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:20,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:20,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593909116] [2022-02-14 15:44:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:20,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:20,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:20,084 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-02-14 15:44:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:20,151 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-02-14 15:44:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 15:44:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:20,153 INFO L225 Difference]: With dead ends: 55 [2022-02-14 15:44:20,154 INFO L226 Difference]: Without dead ends: 53 [2022-02-14 15:44:20,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:20,154 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-14 15:44:20,154 INFO L934 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-02-14 15:44:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-14 15:44:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-02-14 15:44:20,156 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-02-14 15:44:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-02-14 15:44:20,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-02-14 15:44:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:20,157 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-02-14 15:44:20,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-14 15:44:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:20,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:20,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:20,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-14 15:44:20,158 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-02-14 15:44:20,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:20,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856420231] [2022-02-14 15:44:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:20,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:20,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856420231] [2022-02-14 15:44:20,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856420231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:20,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:20,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:20,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152509739] [2022-02-14 15:44:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:20,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:20,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:20,233 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-02-14 15:44:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:20,383 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-02-14 15:44:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 15:44:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:20,384 INFO L225 Difference]: With dead ends: 110 [2022-02-14 15:44:20,385 INFO L226 Difference]: Without dead ends: 108 [2022-02-14 15:44:20,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:20,386 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:20,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 233 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-14 15:44:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-02-14 15:44:20,396 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-02-14 15:44:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-14 15:44:20,397 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-02-14 15:44:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:20,397 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-14 15:44:20,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-14 15:44:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 15:44:20,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:20,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:20,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-14 15:44:20,400 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-02-14 15:44:20,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:20,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984145030] [2022-02-14 15:44:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:20,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:20,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984145030] [2022-02-14 15:44:20,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984145030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:20,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:20,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:20,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606352814] [2022-02-14 15:44:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:20,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:20,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:20,502 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-02-14 15:44:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:20,618 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-02-14 15:44:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 15:44:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:20,619 INFO L225 Difference]: With dead ends: 108 [2022-02-14 15:44:20,619 INFO L226 Difference]: Without dead ends: 106 [2022-02-14 15:44:20,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:20,620 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:20,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 168 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-14 15:44:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-02-14 15:44:20,624 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-02-14 15:44:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-02-14 15:44:20,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-02-14 15:44:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:20,625 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-02-14 15:44:20,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-14 15:44:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:20,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:20,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:20,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-14 15:44:20,626 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-02-14 15:44:20,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:20,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138443833] [2022-02-14 15:44:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:20,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:20,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138443833] [2022-02-14 15:44:20,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138443833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:20,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:20,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 15:44:20,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314512698] [2022-02-14 15:44:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:20,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 15:44:20,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 15:44:20,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 15:44:20,674 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-02-14 15:44:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:20,767 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-02-14 15:44:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 15:44:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 15:44:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:20,768 INFO L225 Difference]: With dead ends: 79 [2022-02-14 15:44:20,768 INFO L226 Difference]: Without dead ends: 77 [2022-02-14 15:44:20,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:20,768 INFO L933 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-02-14 15:44:20,769 INFO L934 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-02-14 15:44:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-14 15:44:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-02-14 15:44:20,772 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-02-14 15:44:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-14 15:44:20,772 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-02-14 15:44:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:20,772 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-14 15:44:20,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-14 15:44:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:20,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:20,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:20,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-14 15:44:20,773 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-02-14 15:44:20,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:20,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171397358] [2022-02-14 15:44:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:20,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:20,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171397358] [2022-02-14 15:44:20,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171397358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:20,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:20,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:20,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293563498] [2022-02-14 15:44:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:20,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:20,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:20,869 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-02-14 15:44:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,001 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-02-14 15:44:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:21,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 15:44:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,003 INFO L225 Difference]: With dead ends: 90 [2022-02-14 15:44:21,003 INFO L226 Difference]: Without dead ends: 88 [2022-02-14 15:44:21,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:21,004 INFO L933 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-02-14 15:44:21,005 INFO L934 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-02-14 15:44:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-14 15:44:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-02-14 15:44:21,012 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-02-14 15:44:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-02-14 15:44:21,012 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-02-14 15:44:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,014 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-02-14 15:44:21,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-02-14 15:44:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 15:44:21,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-14 15:44:21,015 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-02-14 15:44:21,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609802797] [2022-02-14 15:44:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609802797] [2022-02-14 15:44:21,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609802797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:21,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393392969] [2022-02-14 15:44:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:21,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:21,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,099 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-02-14 15:44:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,193 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-02-14 15:44:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 15:44:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,194 INFO L225 Difference]: With dead ends: 74 [2022-02-14 15:44:21,194 INFO L226 Difference]: Without dead ends: 70 [2022-02-14 15:44:21,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:21,197 INFO L933 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-02-14 15:44:21,197 INFO L934 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-02-14 15:44:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-14 15:44:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-02-14 15:44:21,202 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-02-14 15:44:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-02-14 15:44:21,202 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-02-14 15:44:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,202 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-02-14 15:44:21,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-14 15:44:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 15:44:21,205 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-14 15:44:21,205 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-02-14 15:44:21,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153111834] [2022-02-14 15:44:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153111834] [2022-02-14 15:44:21,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153111834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:21,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441916324] [2022-02-14 15:44:21,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:21,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,300 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-02-14 15:44:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,411 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-02-14 15:44:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 15:44:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,412 INFO L225 Difference]: With dead ends: 91 [2022-02-14 15:44:21,412 INFO L226 Difference]: Without dead ends: 89 [2022-02-14 15:44:21,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-14 15:44:21,413 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:21,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 162 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-14 15:44:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-02-14 15:44:21,418 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-02-14 15:44:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-02-14 15:44:21,419 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-02-14 15:44:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,419 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-02-14 15:44:21,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-02-14 15:44:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 15:44:21,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-14 15:44:21,420 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-02-14 15:44:21,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032424119] [2022-02-14 15:44:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032424119] [2022-02-14 15:44:21,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032424119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:21,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276205030] [2022-02-14 15:44:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:21,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:21,454 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-02-14 15:44:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,502 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-02-14 15:44:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 15:44:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,502 INFO L225 Difference]: With dead ends: 66 [2022-02-14 15:44:21,502 INFO L226 Difference]: Without dead ends: 64 [2022-02-14 15:44:21,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,503 INFO L933 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-02-14 15:44:21,503 INFO L934 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-02-14 15:44:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-14 15:44:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-14 15:44:21,507 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-02-14 15:44:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-02-14 15:44:21,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-02-14 15:44:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,508 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-02-14 15:44:21,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-14 15:44:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-14 15:44:21,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-14 15:44:21,509 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-02-14 15:44:21,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012174551] [2022-02-14 15:44:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012174551] [2022-02-14 15:44:21,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012174551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 15:44:21,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087355995] [2022-02-14 15:44:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 15:44:21,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 15:44:21,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 15:44:21,540 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-02-14 15:44:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,588 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-02-14 15:44:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 15:44:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-14 15:44:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,589 INFO L225 Difference]: With dead ends: 64 [2022-02-14 15:44:21,589 INFO L226 Difference]: Without dead ends: 60 [2022-02-14 15:44:21,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,590 INFO L933 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-02-14 15:44:21,590 INFO L934 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-02-14 15:44:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-14 15:44:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-14 15:44:21,594 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-02-14 15:44:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-02-14 15:44:21,594 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-02-14 15:44:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,595 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-02-14 15:44:21,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-02-14 15:44:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-14 15:44:21,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-14 15:44:21,596 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-02-14 15:44:21,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965975739] [2022-02-14 15:44:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965975739] [2022-02-14 15:44:21,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965975739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:21,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:21,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-14 15:44:21,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009390495] [2022-02-14 15:44:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:21,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 15:44:21,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 15:44:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-14 15:44:21,650 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-02-14 15:44:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:21,765 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-14 15:44:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:21,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-14 15:44:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:21,765 INFO L225 Difference]: With dead ends: 75 [2022-02-14 15:44:21,766 INFO L226 Difference]: Without dead ends: 73 [2022-02-14 15:44:21,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-14 15:44:21,766 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-14 15:44:21,766 INFO L934 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-02-14 15:44:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-14 15:44:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-02-14 15:44:21,770 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-02-14 15:44:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-02-14 15:44:21,770 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-02-14 15:44:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:21,770 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-02-14 15:44:21,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-02-14 15:44:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-14 15:44:21,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:21,771 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:21,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-14 15:44:21,771 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-02-14 15:44:21,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:21,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956118938] [2022-02-14 15:44:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:21,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:21,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956118938] [2022-02-14 15:44:21,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956118938] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 15:44:21,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745009031] [2022-02-14 15:44:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 15:44:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 15:44:21,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 15:44:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-14 15:44:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:21,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 15:44:21,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 15:44:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 15:44:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 15:44:22,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745009031] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 15:44:22,229 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 15:44:22,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-02-14 15:44:22,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090999157] [2022-02-14 15:44:22,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 15:44:22,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 15:44:22,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 15:44:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-14 15:44:22,231 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:22,453 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-02-14 15:44:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-14 15:44:22,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-14 15:44:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:22,453 INFO L225 Difference]: With dead ends: 102 [2022-02-14 15:44:22,454 INFO L226 Difference]: Without dead ends: 100 [2022-02-14 15:44:22,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-02-14 15:44:22,455 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 301 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:22,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 108 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-14 15:44:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 51. [2022-02-14 15:44:22,461 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-02-14 15:44:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-02-14 15:44:22,461 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-02-14 15:44:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:22,462 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-02-14 15:44:22,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-14 15:44:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-14 15:44:22,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:22,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:22,482 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-02-14 15:44:22,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 15:44:22,680 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-02-14 15:44:22,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:22,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912814621] [2022-02-14 15:44:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:22,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912814621] [2022-02-14 15:44:22,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912814621] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 15:44:22,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773684097] [2022-02-14 15:44:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:22,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 15:44:22,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 15:44:22,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 15:44:22,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-14 15:44:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:22,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 15:44:22,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 15:44:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:22,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 15:44:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 15:44:23,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773684097] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 15:44:23,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 15:44:23,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-02-14 15:44:23,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280888526] [2022-02-14 15:44:23,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 15:44:23,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 15:44:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-14 15:44:23,043 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,253 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-02-14 15:44:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-14 15:44:23,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-14 15:44:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,254 INFO L225 Difference]: With dead ends: 113 [2022-02-14 15:44:23,254 INFO L226 Difference]: Without dead ends: 111 [2022-02-14 15:44:23,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-02-14 15:44:23,255 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 269 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 117 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 15:44:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-14 15:44:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 44. [2022-02-14 15:44:23,259 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-02-14 15:44:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-14 15:44:23,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-02-14 15:44:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,259 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-14 15:44:23,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 15:44:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-14 15:44:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 15:44:23,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 15:44:23,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-02-14 15:44:23,468 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-02-14 15:44:23,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011190240] [2022-02-14 15:44:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 15:44:23,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011190240] [2022-02-14 15:44:23,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011190240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 15:44:23,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378330668] [2022-02-14 15:44:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 15:44:23,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 15:44:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:23,520 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-02-14 15:44:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,605 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-02-14 15:44:23,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 15:44:23,606 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-02-14 15:44:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,606 INFO L225 Difference]: With dead ends: 56 [2022-02-14 15:44:23,606 INFO L226 Difference]: Without dead ends: 54 [2022-02-14 15:44:23,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-14 15:44:23,608 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-14 15:44:23,608 INFO L934 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-02-14 15:44:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-14 15:44:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-02-14 15:44:23,612 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-02-14 15:44:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-02-14 15:44:23,612 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-02-14 15:44:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,612 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-02-14 15:44:23,612 INFO L471 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-02-14 15:44:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-14 15:44:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 15:44:23,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 15:44:23,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:44:23,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-14 15:44:23,613 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-14 15:44:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 15:44:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-02-14 15:44:23,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 15:44:23,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867508556] [2022-02-14 15:44:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 15:44:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 15:44:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 15:44:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 15:44:23,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-02-14 15:44:23,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 15:44:23,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867508556] [2022-02-14 15:44:23,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867508556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 15:44:23,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 15:44:23,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 15:44:23,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824088548] [2022-02-14 15:44:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 15:44:23,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 15:44:23,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 15:44:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 15:44:23,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 15:44:23,680 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-02-14 15:44:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 15:44:23,742 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-14 15:44:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 15:44:23,743 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-02-14 15:44:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 15:44:23,743 INFO L225 Difference]: With dead ends: 39 [2022-02-14 15:44:23,743 INFO L226 Difference]: Without dead ends: 0 [2022-02-14 15:44:23,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-14 15:44:23,745 INFO L933 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.0s IncrementalHoareTripleChecker+Time [2022-02-14 15:44:23,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 38 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 15:44:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-14 15:44:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-14 15:44:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-14 15:44:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-14 15:44:23,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-02-14 15:44:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 15:44:23,746 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-14 15:44:23,746 INFO L471 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-02-14 15:44:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-14 15:44:23,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-14 15:44:23,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-02-14 15:44:23,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-02-14 15:44:23,749 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-02-14 15:44:23,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-02-14 15:44:23,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-14 15:44:23,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-14 15:47:34,331 WARN L228 SmtUtils]: Spent 3.18m on a formula simplification. DAG size of input: 90 DAG size of output: 91 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-14 15:47:41,059 WARN L228 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 87 DAG size of output: 46 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-14 15:48:44,359 WARN L228 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 76 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-14 15:48:44,864 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 15 402) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2022-02-14 15:48:44,865 INFO L858 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2022-02-14 15:48:44,866 INFO L854 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (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 .cse1 (< 0 main_~main__tagbuf_len~0)) (and (<= 1 main_~__VERIFIER_assert__cond~19) .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-02-14 15:48:44,866 INFO L854 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (or (and .cse0 (< 0 main_~main__tagbuf_len~0)) (and (<= 1 main_~__VERIFIER_assert__cond~17) (let ((.cse1 (<= main_~main__t~0 1))) (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~17 0))) (.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (or (not (= main_~__VERIFIER_assert__cond~13 0)) (and (<= 0 main_~main__tagbuf_len~0) .cse0)))) (or (and .cse6 (<= 1 main_~main__t~0)) (and .cse6 .cse0))))) (or (and .cse5 .cse0) (and .cse5 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and .cse1 .cse4 (not (<= main_~main__tagbuf_len~0 0))) (and .cse4 (not (= main_~__VERIFIER_assert__cond~19 0))))))) (or (and .cse1 .cse2 (< main_~main__t~0 main_~main__tagbuf_len~0) .cse3) (and (<= 1 main_~__VERIFIER_assert__cond~19) .cse2 .cse3 (not (<= main_~main__tagbuf_len~0 main_~main__t~0))))))))) [2022-02-14 15:48:44,866 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 15 402) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L854 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-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L854 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-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2022-02-14 15:48:44,867 INFO L858 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2022-02-14 15:48:44,868 INFO L858 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L861 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L854 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-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2022-02-14 15:48:44,869 INFO L858 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L854 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-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-14 15:48:44,870 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-14 15:48:44,870 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-14 15:48:44,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-14 15:48:44,873 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 15:48:44,874 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-14 15:48:44,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 03:48:44 BoogieIcfgContainer [2022-02-14 15:48:44,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-14 15:48:44,901 INFO L158 Benchmark]: Toolchain (without parser) took 267591.10ms. Allocated memory was 211.8MB in the beginning and 723.5MB in the end (delta: 511.7MB). Free memory was 160.5MB in the beginning and 301.0MB in the end (delta: -140.5MB). Peak memory consumption was 413.2MB. Max. memory is 8.0GB. [2022-02-14 15:48:44,901 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 211.8MB. Free memory is still 176.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-14 15:48:44,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.60ms. Allocated memory is still 211.8MB. Free memory was 160.3MB in the beginning and 182.2MB in the end (delta: -21.9MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. [2022-02-14 15:48:44,901 INFO L158 Benchmark]: Boogie Preprocessor took 34.42ms. Allocated memory is still 211.8MB. Free memory was 182.2MB in the beginning and 180.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-14 15:48:44,901 INFO L158 Benchmark]: RCFGBuilder took 420.55ms. Allocated memory is still 211.8MB. Free memory was 180.7MB in the beginning and 165.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-14 15:48:44,902 INFO L158 Benchmark]: TraceAbstraction took 266858.68ms. Allocated memory was 211.8MB in the beginning and 723.5MB in the end (delta: 511.7MB). Free memory was 165.0MB in the beginning and 301.0MB in the end (delta: -136.1MB). Peak memory consumption was 416.9MB. Max. memory is 8.0GB. [2022-02-14 15:48:44,902 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.13ms. Allocated memory is still 211.8MB. Free memory is still 176.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.60ms. Allocated memory is still 211.8MB. Free memory was 160.3MB in the beginning and 182.2MB in the end (delta: -21.9MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.42ms. Allocated memory is still 211.8MB. Free memory was 182.2MB in the beginning and 180.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 420.55ms. Allocated memory is still 211.8MB. Free memory was 180.7MB in the beginning and 165.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 266858.68ms. Allocated memory was 211.8MB in the beginning and 723.5MB in the end (delta: 511.7MB). Free memory was 165.0MB in the beginning and 301.0MB in the end (delta: -136.1MB). Peak memory consumption was 416.9MB. 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: 266.8s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 261.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1888 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1888 mSDsluCounter, 2950 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1857 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3500 IncrementalHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 1093 mSDtfsCounter, 3500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 508 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 519 HoareAnnotationTreeSize, 9 FomulaSimplifications, 3331877 FormulaSimplificationTreeSizeReduction, 260.6s HoareSimplificationTime, 9 FomulaSimplificationsInter, 11210759 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 1950 SizeOfPredicates, 6 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__t == 0 && 0 < main__tagbuf_len) || (1 <= __VERIFIER_assert__cond && ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && (((main__t <= 1 && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)))) || (((1 <= __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && (((main__t <= 1 && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && main__t == 0) || ((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 1 <= main__t) || ((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)))) - 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)) && main__t == 0) && 0 < main__tagbuf_len) || ((1 <= __VERIFIER_assert__cond && ((((!(__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__tagbuf_len <= main__t)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-02-14 15:48:44,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...