/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:29:57,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:29:57,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:29:57,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:29:57,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:29:57,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:29:57,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:29:57,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:29:57,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:29:57,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:29:57,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:29:57,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:29:57,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:29:57,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:29:57,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:29:57,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:29:57,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:29:57,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:29:57,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:29:57,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:29:57,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:29:57,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:29:57,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:29:57,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:29:57,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:29:57,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:29:57,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:29:57,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:29:57,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:29:57,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:29:57,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:29:57,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:29:57,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:29:57,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:29:57,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:29:57,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:29:57,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:29:57,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:29:57,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:29:57,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:29:57,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:29:57,191 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:29:57,202 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:29:57,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:29:57,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:29:57,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:29:57,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:29:57,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:29:57,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:29:57,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:29:57,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:29:57,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:29:57,207 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:29:57,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:29:57,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:29:57,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:29:57,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:29:57,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:29:57,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:29:57,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:29:57,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:29:57,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:29:57,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:29:57,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:29:57,209 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:29:57,209 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:29:57,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:29:57,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:29:57,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:29:57,547 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:29:57,548 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:29:57,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-02 23:29:57,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339e18f25/7d705da938d947788b2789730952df2f/FLAG87190d77a [2021-05-02 23:29:58,018 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:29:58,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-02 23:29:58,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339e18f25/7d705da938d947788b2789730952df2f/FLAG87190d77a [2021-05-02 23:29:58,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339e18f25/7d705da938d947788b2789730952df2f [2021-05-02 23:29:58,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:29:58,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:29:58,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:29:58,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:29:58,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:29:58,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517cdd65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58, skipping insertion in model container [2021-05-02 23:29:58,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:29:58,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:29:58,275 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-02 23:29:58,283 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-02 23:29:58,289 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-02 23:29:58,306 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-02 23:29:58,307 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-02 23:29:58,308 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-02 23:29:58,340 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-02 23:29:58,342 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-02 23:29:58,343 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-02 23:29:58,344 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-02 23:29:58,346 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-02 23:29:58,347 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-02 23:29:58,348 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-02 23:29:58,351 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-02 23:29:58,353 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-02 23:29:58,354 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-02 23:29:58,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:29:58,365 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:29:58,377 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-02 23:29:58,378 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-02 23:29:58,379 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-02 23:29:58,380 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-02 23:29:58,381 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-02 23:29:58,382 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-02 23:29:58,384 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-02 23:29:58,385 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-02 23:29:58,386 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-02 23:29:58,387 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-02 23:29:58,388 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-02 23:29:58,389 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-02 23:29:58,390 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-02 23:29:58,391 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-02 23:29:58,392 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-02 23:29:58,393 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-02 23:29:58,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:29:58,407 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:29:58,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58 WrapperNode [2021-05-02 23:29:58,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:29:58,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:29:58,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:29:58,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:29:58,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... [2021-05-02 23:29:58,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:29:58,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:29:58,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:29:58,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:29:58,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:29:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:29:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:29:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:29:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:29:58,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:29:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:29:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:29:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:29:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:29:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:29:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:29:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:29:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:29:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:29:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:29:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:29:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:29:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:29:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:29:58,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:29:58,950 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 23:29:58,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:29:58 BoogieIcfgContainer [2021-05-02 23:29:58,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:29:58,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:29:58,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:29:58,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:29:58,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:29:58" (1/3) ... [2021-05-02 23:29:58,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8b1f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:29:58, skipping insertion in model container [2021-05-02 23:29:58,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:58" (2/3) ... [2021-05-02 23:29:58,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8b1f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:29:58, skipping insertion in model container [2021-05-02 23:29:58,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:29:58" (3/3) ... [2021-05-02 23:29:58,958 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-02 23:29:58,962 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:29:58,965 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-02 23:29:58,981 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-02 23:29:59,000 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:29:59,000 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:29:59,000 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:29:59,001 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:29:59,001 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:29:59,001 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:29:59,001 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:29:59,001 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:29:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 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) [2021-05-02 23:29:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:29:59,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:59,028 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:59,029 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2021-05-02 23:29:59,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:59,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025799560] [2021-05-02 23:29:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:59,112 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:59,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:59,382 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:59,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025799560] [2021-05-02 23:29:59,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1025799560] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:59,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:59,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:29:59,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852308058] [2021-05-02 23:29:59,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:29:59,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:29:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:29:59,409 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:59,624 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2021-05-02 23:29:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:29:59,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 23:29:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:59,632 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:29:59,632 INFO L226 Difference]: Without dead ends: 76 [2021-05-02 23:29:59,634 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:29:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-02 23:29:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-02 23:29:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) 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) [2021-05-02 23:29:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-02 23:29:59,678 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-02 23:29:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:59,678 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-02 23:29:59,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-02 23:29:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:29:59,679 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:59,679 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:59,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:29:59,680 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2021-05-02 23:29:59,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:59,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249576922] [2021-05-02 23:29:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:59,683 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:59,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:59,764 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:59,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [249576922] [2021-05-02 23:29:59,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [249576922] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:59,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:59,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:29:59,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723910717] [2021-05-02 23:29:59,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:29:59,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:29:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:29:59,767 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-05-02 23:30:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:00,097 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2021-05-02 23:30:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2021-05-02 23:30:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:00,106 INFO L225 Difference]: With dead ends: 153 [2021-05-02 23:30:00,106 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:30:00,109 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:30:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:30:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2021-05-02 23:30:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 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) [2021-05-02 23:30:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-05-02 23:30:00,142 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2021-05-02 23:30:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:00,142 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-05-02 23:30:00,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-05-02 23:30:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-05-02 23:30:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:30:00,143 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:00,143 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:00,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:30:00,144 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2021-05-02 23:30:00,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:00,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895398066] [2021-05-02 23:30:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:00,152 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:00,273 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:00,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895398066] [2021-05-02 23:30:00,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [895398066] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:00,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:00,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:00,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868325183] [2021-05-02 23:30:00,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:00,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:00,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:00,276 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-05-02 23:30:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:00,445 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-02 23:30:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:30:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2021-05-02 23:30:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:00,449 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:30:00,449 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:30:00,450 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:30:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2021-05-02 23:30:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-02 23:30:00,474 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-02 23:30:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:00,474 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-02 23:30:00,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-05-02 23:30:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-02 23:30:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:30:00,476 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:00,476 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:00,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:30:00,476 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2021-05-02 23:30:00,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:00,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1027443074] [2021-05-02 23:30:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:00,481 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:00,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:00,577 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:00,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1027443074] [2021-05-02 23:30:00,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1027443074] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:00,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:00,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:00,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500502186] [2021-05-02 23:30:00,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:00,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:00,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:00,581 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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) [2021-05-02 23:30:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:00,766 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-05-02 23:30:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:30:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 [2021-05-02 23:30:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:00,768 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:30:00,768 INFO L226 Difference]: Without dead ends: 94 [2021-05-02 23:30:00,769 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-02 23:30:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-02 23:30:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-02 23:30:00,789 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-02 23:30:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:00,790 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-02 23:30:00,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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) [2021-05-02 23:30:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-02 23:30:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 23:30:00,791 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:00,791 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:00,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:30:00,791 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2021-05-02 23:30:00,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:00,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333314808] [2021-05-02 23:30:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:00,794 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:00,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:00,890 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:00,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333314808] [2021-05-02 23:30:00,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [333314808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:00,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:00,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:00,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956989671] [2021-05-02 23:30:00,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:00,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:00,895 INFO L87 Difference]: Start difference. First operand 54 states and 58 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) [2021-05-02 23:30:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:01,175 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-05-02 23:30:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:01,177 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 [2021-05-02 23:30:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:01,178 INFO L225 Difference]: With dead ends: 95 [2021-05-02 23:30:01,178 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:30:01,179 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 149.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:30:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-05-02 23:30:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-02 23:30:01,209 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-02 23:30:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:01,209 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-02 23:30:01,210 INFO L481 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) [2021-05-02 23:30:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-02 23:30:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 23:30:01,211 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:01,211 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:01,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:30:01,211 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2021-05-02 23:30:01,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:01,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81361731] [2021-05-02 23:30:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:01,214 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:01,295 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:01,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81361731] [2021-05-02 23:30:01,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [81361731] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:01,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:01,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:01,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743722633] [2021-05-02 23:30:01,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:01,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:01,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:01,297 INFO L87 Difference]: Start difference. First operand 52 states and 56 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) [2021-05-02 23:30:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:01,536 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-02 23:30:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:01,537 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 [2021-05-02 23:30:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:01,538 INFO L225 Difference]: With dead ends: 69 [2021-05-02 23:30:01,538 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:30:01,538 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 138.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:30:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:30:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2021-05-02 23:30:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 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) [2021-05-02 23:30:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-02 23:30:01,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-02 23:30:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:01,568 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-02 23:30:01,568 INFO L481 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) [2021-05-02 23:30:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-02 23:30:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:30:01,569 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:01,569 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:01,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:30:01,569 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2021-05-02 23:30:01,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:01,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641734115] [2021-05-02 23:30:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:01,572 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:01,629 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:01,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641734115] [2021-05-02 23:30:01,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1641734115] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:01,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:01,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:01,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453475062] [2021-05-02 23:30:01,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:01,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:01,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:01,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:01,631 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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) [2021-05-02 23:30:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:01,817 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2021-05-02 23:30:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:30:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 [2021-05-02 23:30:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:01,818 INFO L225 Difference]: With dead ends: 91 [2021-05-02 23:30:01,818 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:30:01,819 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:30:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2021-05-02 23:30:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:30:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-02 23:30:01,833 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-02 23:30:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:01,834 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-02 23:30:01,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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) [2021-05-02 23:30:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-02 23:30:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:30:01,834 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:01,834 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:01,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:30:01,835 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2021-05-02 23:30:01,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:01,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [761292257] [2021-05-02 23:30:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:01,838 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:01,908 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:01,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [761292257] [2021-05-02 23:30:01,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [761292257] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:01,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:01,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:01,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051181435] [2021-05-02 23:30:01,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:01,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:01,910 INFO L87 Difference]: Start difference. First operand 48 states and 52 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) [2021-05-02 23:30:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:02,227 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-05-02 23:30:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:02,228 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 [2021-05-02 23:30:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:02,228 INFO L225 Difference]: With dead ends: 73 [2021-05-02 23:30:02,229 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:30:02,229 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 203.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:30:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-05-02 23:30:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 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) [2021-05-02 23:30:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-02 23:30:02,249 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-02 23:30:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:02,249 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-02 23:30:02,250 INFO L481 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) [2021-05-02 23:30:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-02 23:30:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 23:30:02,251 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:02,251 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:02,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:30:02,251 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2021-05-02 23:30:02,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:02,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322072551] [2021-05-02 23:30:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:02,254 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:02,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:02,343 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:02,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322072551] [2021-05-02 23:30:02,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [322072551] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:02,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:02,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:02,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812568519] [2021-05-02 23:30:02,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:02,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:02,346 INFO L87 Difference]: Start difference. First operand 46 states and 50 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) [2021-05-02 23:30:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:02,565 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-02 23:30:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:02,566 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 [2021-05-02 23:30:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:02,566 INFO L225 Difference]: With dead ends: 61 [2021-05-02 23:30:02,567 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:30:02,567 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 137.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:30:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-02 23:30:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 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) [2021-05-02 23:30:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-02 23:30:02,580 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-02 23:30:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:02,581 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-02 23:30:02,581 INFO L481 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) [2021-05-02 23:30:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-02 23:30:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:30:02,581 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:02,581 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:02,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:30:02,582 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2021-05-02 23:30:02,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:02,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973774385] [2021-05-02 23:30:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:02,584 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:02,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:02,638 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:02,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973774385] [2021-05-02 23:30:02,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [973774385] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:02,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:02,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:02,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129169775] [2021-05-02 23:30:02,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:02,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:02,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:02,639 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2021-05-02 23:30:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:02,800 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-02 23:30:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:30:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 [2021-05-02 23:30:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:02,802 INFO L225 Difference]: With dead ends: 61 [2021-05-02 23:30:02,802 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:30:02,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:30:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-02 23:30:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 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) [2021-05-02 23:30:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-02 23:30:02,817 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-02 23:30:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:02,817 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-02 23:30:02,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) [2021-05-02 23:30:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-02 23:30:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:30:02,818 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:02,818 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:02,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:30:02,818 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2021-05-02 23:30:02,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:02,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230680164] [2021-05-02 23:30:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:02,821 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:02,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:02,874 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:02,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230680164] [2021-05-02 23:30:02,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1230680164] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:02,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:02,875 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:02,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657606160] [2021-05-02 23:30:02,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:02,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:02,876 INFO L87 Difference]: Start difference. First operand 42 states and 46 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) [2021-05-02 23:30:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:03,084 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-02 23:30:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:03,084 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 [2021-05-02 23:30:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:03,085 INFO L225 Difference]: With dead ends: 69 [2021-05-02 23:30:03,085 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:30:03,085 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 112.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:30:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:30:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-02 23:30:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 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) [2021-05-02 23:30:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-02 23:30:03,098 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-02 23:30:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:03,099 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-02 23:30:03,099 INFO L481 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) [2021-05-02 23:30:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-02 23:30:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:30:03,099 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:03,099 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:03,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:30:03,100 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2021-05-02 23:30:03,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:03,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226560133] [2021-05-02 23:30:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:03,102 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:03,157 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:03,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226560133] [2021-05-02 23:30:03,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1226560133] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:03,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:03,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:03,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686899926] [2021-05-02 23:30:03,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:03,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:03,159 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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) [2021-05-02 23:30:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:03,412 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2021-05-02 23:30:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 [2021-05-02 23:30:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:03,414 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:30:03,414 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 23:30:03,415 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 23:30:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-02 23:30:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 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) [2021-05-02 23:30:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-02 23:30:03,441 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-02 23:30:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:03,441 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-02 23:30:03,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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) [2021-05-02 23:30:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-02 23:30:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 23:30:03,442 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:03,442 INFO L523 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] [2021-05-02 23:30:03,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:30:03,442 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2021-05-02 23:30:03,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:03,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116194899] [2021-05-02 23:30:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:03,445 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:03,534 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:03,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116194899] [2021-05-02 23:30:03,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2116194899] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:03,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:03,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:03,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744296474] [2021-05-02 23:30:03,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:03,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:03,536 INFO L87 Difference]: Start difference. First operand 38 states and 42 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) [2021-05-02 23:30:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:03,853 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2021-05-02 23:30:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:03,854 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 [2021-05-02 23:30:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:03,855 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:30:03,855 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 23:30:03,855 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 196.9ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:30:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 23:30:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-02 23:30:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 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) [2021-05-02 23:30:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-02 23:30:03,869 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-02 23:30:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:03,869 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-02 23:30:03,869 INFO L481 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) [2021-05-02 23:30:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-02 23:30:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:30:03,870 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:03,870 INFO L523 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] [2021-05-02 23:30:03,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:30:03,870 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2021-05-02 23:30:03,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:03,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [354238696] [2021-05-02 23:30:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:03,873 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:03,962 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:03,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [354238696] [2021-05-02 23:30:03,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [354238696] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:03,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:03,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:03,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12742548] [2021-05-02 23:30:03,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:03,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:03,964 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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) [2021-05-02 23:30:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:04,326 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2021-05-02 23:30:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 [2021-05-02 23:30:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:04,327 INFO L225 Difference]: With dead ends: 87 [2021-05-02 23:30:04,327 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:30:04,328 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 162.0ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:30:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-02 23:30:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 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) [2021-05-02 23:30:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-02 23:30:04,341 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-02 23:30:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-02 23:30:04,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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) [2021-05-02 23:30:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-02 23:30:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 23:30:04,342 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,342 INFO L523 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, 1] [2021-05-02 23:30:04,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:30:04,342 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2021-05-02 23:30:04,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182135190] [2021-05-02 23:30:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:04,345 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:04,419 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:04,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182135190] [2021-05-02 23:30:04,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1182135190] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:04,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:04,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:04,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935241062] [2021-05-02 23:30:04,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:04,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:04,421 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-05-02 23:30:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:04,731 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-02 23:30:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2021-05-02 23:30:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:04,733 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:30:04,733 INFO L226 Difference]: Without dead ends: 58 [2021-05-02 23:30:04,735 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 206.6ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:30:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-02 23:30:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-02 23:30:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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) [2021-05-02 23:30:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-02 23:30:04,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-02 23:30:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,756 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-02 23:30:04,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) [2021-05-02 23:30:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-02 23:30:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:30:04,760 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,761 INFO L523 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, 1, 1] [2021-05-02 23:30:04,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:30:04,762 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2021-05-02 23:30:04,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883050847] [2021-05-02 23:30:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:04,764 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:04,870 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:04,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883050847] [2021-05-02 23:30:04,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1883050847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:04,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:04,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:04,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967585897] [2021-05-02 23:30:04,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:04,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:04,872 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-05-02 23:30:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:05,372 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-05-02 23:30:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2021-05-02 23:30:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:05,373 INFO L225 Difference]: With dead ends: 125 [2021-05-02 23:30:05,373 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:30:05,374 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 208.3ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:30:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:30:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:30:05,374 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) [2021-05-02 23:30:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:30:05,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-02 23:30:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:05,375 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:30:05,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-05-02 23:30:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:30:05,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:30:05,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:30:05,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:30:05,732 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 129 [2021-05-02 23:30:06,067 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 134 [2021-05-02 23:30:06,254 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 137 [2021-05-02 23:30:06,463 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 145 [2021-05-02 23:30:06,689 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 137 [2021-05-02 23:30:06,926 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2021-05-02 23:30:07,209 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 132 [2021-05-02 23:30:07,530 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 113 [2021-05-02 23:30:07,845 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 156 [2021-05-02 23:30:08,076 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 136 [2021-05-02 23:30:08,198 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 139 [2021-05-02 23:30:08,355 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 146 [2021-05-02 23:30:08,497 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2021-05-02 23:30:08,704 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2021-05-02 23:30:08,926 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 137 [2021-05-02 23:30:09,215 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 30 [2021-05-02 23:30:09,401 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 18 [2021-05-02 23:30:09,587 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 42 [2021-05-02 23:30:09,818 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2021-05-02 23:30:10,019 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2021-05-02 23:30:10,228 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 32 [2021-05-02 23:30:10,396 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2021-05-02 23:30:10,523 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 13 [2021-05-02 23:30:10,768 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2021-05-02 23:30:10,955 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 25 [2021-05-02 23:30:11,118 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 38 [2021-05-02 23:30:11,312 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 28 [2021-05-02 23:30:11,497 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2021-05-02 23:30:11,854 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 26 [2021-05-02 23:30:12,028 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2021-05-02 23:30:12,212 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2021-05-02 23:30:12,298 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 23:30:12,298 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 23:30:12,298 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 23:30:12,298 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:12,298 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__return_334~0 |old(~__return_334~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-02 23:30:12,298 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:12,298 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:12,298 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:30:12,299 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:30:12,299 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:12,299 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-02 23:30:12,299 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-02 23:30:12,299 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-02 23:30:12,299 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-02 23:30:12,299 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) the Hoare annotation is: false [2021-05-02 23:30:12,299 INFO L194 CegarLoopUtils]: At program point L217(line 217) the Hoare annotation is: false [2021-05-02 23:30:12,299 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 13 313) the Hoare annotation is: true [2021-05-02 23:30:12,299 INFO L194 CegarLoopUtils]: At program point L151(lines 151 281) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L110(lines 110 123) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~3 0)) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) the Hoare annotation is: false [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L36(lines 36 300) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= 0 main_~main__j~0) (< main_~main__i~0 main_~main__len~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L193(line 193) the Hoare annotation is: false [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) the Hoare annotation is: false [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L86(lines 86 127) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 0 main_~main__j~0) (< main_~main__i~0 main_~main__len~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L20(lines 20 312) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L243(lines 243 267) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 2 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L177(line 177) the Hoare annotation is: false [2021-05-02 23:30:12,300 INFO L194 CegarLoopUtils]: At program point L45(lines 45 288) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) the Hoare annotation is: false [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 main_~main__i~0) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point L227(lines 227 269) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point L153(line 153) the Hoare annotation is: false [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) the Hoare annotation is: false [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point L112(line 112) the Hoare annotation is: false [2021-05-02 23:30:12,301 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 13 313) the Hoare annotation is: true [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point L203(lines 203 273) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) the Hoare annotation is: false [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point L38(lines 38 294) the Hoare annotation is: (and (<= 0 main_~main__i~0) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0)) [2021-05-02 23:30:12,301 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 313) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L88(line 88) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L245(line 245) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L229(line 229) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L163(lines 163 279) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~8 0))) [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L205(line 205) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) the Hoare annotation is: false [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L139(lines 139 283) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,302 INFO L194 CegarLoopUtils]: At program point L98(lines 98 125) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~4 0)) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0)) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) the Hoare annotation is: false [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L255(lines 255 265) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 2 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~15 0)) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L57(lines 57 286) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L74(lines 74 129) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) the Hoare annotation is: false [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse4 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse0 (= |old(~__return_334~0)| ~__return_334~0)) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (let ((.cse2 (<= 1 main_~main__j~0)) (.cse3 (let ((.cse5 (<= 0 main_~main__j~0)) (.cse6 (<= 1 main_~main__i~0))) (or (and .cse5 .cse6 .cse0 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse1) (and .cse5 .cse6 .cse4 .cse0 .cse1))))) (or (and (<= 0 main_~main__i~0) (= main_~main__j~0 0) (< main_~main__i~0 main_~main__len~0) .cse0 .cse1) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~14 0))) (and .cse2 .cse3 .cse4)))) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L165(line 165) the Hoare annotation is: false [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L66(lines 66 285) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) the Hoare annotation is: false [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L215(lines 215 271) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point L141(line 141) the Hoare annotation is: false [2021-05-02 23:30:12,303 INFO L194 CegarLoopUtils]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: false [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point L257(line 257) the Hoare annotation is: false [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point L191(lines 191 275) the Hoare annotation is: (and (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 1 main_~main__i~0) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0))) [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) the Hoare annotation is: false [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: false [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) the Hoare annotation is: false [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point L175(lines 175 277) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 0 main_~main__j~0) (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~8 0))) [2021-05-02 23:30:12,304 INFO L194 CegarLoopUtils]: At program point L76(line 76) the Hoare annotation is: false [2021-05-02 23:30:12,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:30:12 BoogieIcfgContainer [2021-05-02 23:30:12,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:30:12,322 INFO L168 Benchmark]: Toolchain (without parser) took 14269.55 ms. Allocated memory was 184.5 MB in the beginning and 411.0 MB in the end (delta: 226.5 MB). Free memory was 149.7 MB in the beginning and 252.6 MB in the end (delta: -102.9 MB). Peak memory consumption was 235.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:12,322 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 184.5 MB. Free memory is still 166.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:30:12,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.31 ms. Allocated memory is still 184.5 MB. Free memory was 149.5 MB in the beginning and 162.1 MB in the end (delta: -12.6 MB). Peak memory consumption was 12.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:12,322 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 ms. Allocated memory is still 184.5 MB. Free memory was 162.1 MB in the beginning and 160.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:12,323 INFO L168 Benchmark]: RCFGBuilder took 512.50 ms. Allocated memory is still 184.5 MB. Free memory was 160.3 MB in the beginning and 136.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:12,323 INFO L168 Benchmark]: TraceAbstraction took 13368.38 ms. Allocated memory was 184.5 MB in the beginning and 411.0 MB in the end (delta: 226.5 MB). Free memory was 136.2 MB in the beginning and 252.6 MB in the end (delta: -116.4 MB). Peak memory consumption was 222.8 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:12,324 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.19 ms. Allocated memory is still 184.5 MB. Free memory is still 166.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 352.31 ms. Allocated memory is still 184.5 MB. Free memory was 149.5 MB in the beginning and 162.1 MB in the end (delta: -12.6 MB). Peak memory consumption was 12.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.15 ms. Allocated memory is still 184.5 MB. Free memory was 162.1 MB in the beginning and 160.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 512.50 ms. Allocated memory is still 184.5 MB. Free memory was 160.3 MB in the beginning and 136.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13368.38 ms. Allocated memory was 184.5 MB in the beginning and 411.0 MB in the end (delta: 226.5 MB). Free memory was 136.2 MB in the beginning and 252.6 MB in the end (delta: -116.4 MB). Peak memory consumption was 222.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: 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, 72 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6378.3ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 25.7ms, AutomataDifference: 4342.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6921.4ms, InitialAbstractionConstructionTime: 11.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 941 SDtfs, 1948 SDslu, 201 SDs, 0 SdLazy, 1688 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1522.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2120.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 317.0ms AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 65 LocationsWithAnnotation, 65 PreInvPairs, 189 NumberOfFragments, 1000 HoareAnnotationTreeSize, 65 FomulaSimplifications, 4033300448 FormulaSimplificationTreeSizeReduction, 3557.7ms HoareSimplificationTime, 65 FomulaSimplificationsInter, 5915929 FormulaSimplificationTreeSizeReductionInter, 3342.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((0 <= main__i && main__j == 0) && main__i < main__len) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && !(__VERIFIER_assert__cond == 0))) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((0 <= main__i && main__i < main__len) && 0 <= main__j) && main__j + 5 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (0 <= main__i && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...