/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-6253b08 [2021-05-06 11:33:29,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:33:29,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:33:29,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:33:29,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:33:29,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:33:29,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:33:29,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:33:29,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:33:29,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:33:29,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:33:29,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:33:29,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:33:29,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:33:29,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:33:29,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:33:29,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:33:29,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:33:29,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:33:29,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:33:29,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:33:29,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:33:29,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:33:29,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:33:29,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:33:29,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:33:29,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:33:29,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:33:29,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:33:29,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:33:29,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:33:29,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:33:29,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:33:29,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:33:29,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:33:29,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:33:29,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:33:29,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:33:29,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:33:29,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:33:29,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:33:29,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:33:29,357 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:33:29,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:33:29,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:33:29,360 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:33:29,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:33:29,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:33:29,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:33:29,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:33:29,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:33:29,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:33:29,362 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:33:29,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:33:29,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:33:29,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:33:29,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:33:29,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:33:29,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:33:29,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:33:29,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:33:29,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:33:29,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:33:29,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:33:29,364 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:33:29,364 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-06 11:33:29,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:33:29,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:33:29,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:33:29,683 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:33:29,684 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:33:29,684 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-06 11:33:29,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba29efc/d107327e75ac4cec993e4125b5e6c401/FLAGd3fd60aab [2021-05-06 11:33:30,183 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:33:30,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-06 11:33:30,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba29efc/d107327e75ac4cec993e4125b5e6c401/FLAGd3fd60aab [2021-05-06 11:33:30,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ba29efc/d107327e75ac4cec993e4125b5e6c401 [2021-05-06 11:33:30,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:33:30,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:33:30,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:30,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:33:30,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:33:30,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d58e059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30, skipping insertion in model container [2021-05-06 11:33:30,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:33:30,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:33:30,733 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-06 11:33:30,743 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-06 11:33:30,745 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-06 11:33:30,747 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-06 11:33:30,752 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-06 11:33:30,753 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-06 11:33:30,756 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-06 11:33:30,757 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-06 11:33:30,758 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-06 11:33:30,759 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-06 11:33:30,761 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-06 11:33:30,762 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-06 11:33:30,763 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-06 11:33:30,764 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-06 11:33:30,766 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-06 11:33:30,767 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-06 11:33:30,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:30,776 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:33:30,798 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-06 11:33:30,799 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-06 11:33:30,800 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-06 11:33:30,801 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-06 11:33:30,807 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-06 11:33:30,808 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-06 11:33:30,826 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-06 11:33:30,827 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-06 11:33:30,829 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-06 11:33:30,830 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-06 11:33:30,832 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-06 11:33:30,833 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-06 11:33:30,834 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-06 11:33:30,835 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-06 11:33:30,836 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-06 11:33:30,837 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-06 11:33:30,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:30,850 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:33:30,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30 WrapperNode [2021-05-06 11:33:30,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:30,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:33:30,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:33:30,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:33:30,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (1/1) ... [2021-05-06 11:33:30,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:33:30,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:33:30,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:33:30,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:33:30,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (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-06 11:33:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:33:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:33:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:33:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:33:30,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:33:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:33:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:33:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:33:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:33:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:33:30,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:33:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:33:31,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:33:31,348 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-06 11:33:31,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:31 BoogieIcfgContainer [2021-05-06 11:33:31,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:33:31,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:33:31,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:33:31,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:33:31,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:33:30" (1/3) ... [2021-05-06 11:33:31,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46442104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:31, skipping insertion in model container [2021-05-06 11:33:31,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:30" (2/3) ... [2021-05-06 11:33:31,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46442104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:31, skipping insertion in model container [2021-05-06 11:33:31,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:31" (3/3) ... [2021-05-06 11:33:31,355 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-06 11:33:31,376 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:33:31,379 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-06 11:33:31,409 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-06 11:33:31,425 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:33:31,425 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:33:31,425 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:33:31,425 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:33:31,425 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:33:31,425 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:33:31,425 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:33:31,425 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:33:31,463 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-06 11:33:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-06 11:33:31,468 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:31,469 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:31,470 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-06 11:33:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2021-05-06 11:33:31,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:31,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289336457] [2021-05-06 11:33:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:31,544 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:31,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:31,786 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-06 11:33:31,788 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:31,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289336457] [2021-05-06 11:33:31,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1289336457] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:31,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:31,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:31,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155920522] [2021-05-06 11:33:31,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:31,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:31,806 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-06 11:33:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:32,003 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2021-05-06 11:33:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 11:33:32,004 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-06 11:33:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:32,015 INFO L225 Difference]: With dead ends: 90 [2021-05-06 11:33:32,015 INFO L226 Difference]: Without dead ends: 76 [2021-05-06 11:33:32,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-06 11:33:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-06 11:33:32,069 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-06 11:33:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-06 11:33:32,072 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-06 11:33:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:32,073 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-06 11:33:32,073 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-06 11:33:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-06 11:33:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:32,074 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:32,075 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:32,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:33:32,076 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-06 11:33:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2021-05-06 11:33:32,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:32,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633320262] [2021-05-06 11:33:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:32,090 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:32,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:32,214 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-06 11:33:32,214 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:32,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633320262] [2021-05-06 11:33:32,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1633320262] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:32,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:32,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:32,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134582376] [2021-05-06 11:33:32,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:32,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:32,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:32,216 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-06 11:33:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:32,506 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2021-05-06 11:33:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:32,507 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-06 11:33:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:32,515 INFO L225 Difference]: With dead ends: 153 [2021-05-06 11:33:32,515 INFO L226 Difference]: Without dead ends: 101 [2021-05-06 11:33:32,518 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 117.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-06 11:33:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2021-05-06 11:33:32,539 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-06 11:33:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-05-06 11:33:32,541 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2021-05-06 11:33:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:32,541 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-05-06 11:33:32,541 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-06 11:33:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-05-06 11:33:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:32,542 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:32,542 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:32,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:33:32,542 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-06 11:33:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2021-05-06 11:33:32,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:32,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815466285] [2021-05-06 11:33:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:32,545 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:32,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:32,608 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-06 11:33:32,609 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:32,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815466285] [2021-05-06 11:33:32,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1815466285] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:32,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:32,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:32,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441647616] [2021-05-06 11:33:32,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:32,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:32,611 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-06 11:33:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:32,783 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-06 11:33:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 11:33:32,783 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-06 11:33:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:32,786 INFO L225 Difference]: With dead ends: 75 [2021-05-06 11:33:32,787 INFO L226 Difference]: Without dead ends: 73 [2021-05-06 11:33:32,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-06 11:33:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2021-05-06 11:33:32,807 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-06 11:33:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-06 11:33:32,810 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-06 11:33:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:32,810 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-06 11:33:32,811 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-06 11:33:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-06 11:33:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-06 11:33:32,812 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:32,812 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:32,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:33:32,812 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-06 11:33:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2021-05-06 11:33:32,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:32,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354983931] [2021-05-06 11:33:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:32,816 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:32,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:32,915 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-06 11:33:32,915 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:32,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354983931] [2021-05-06 11:33:32,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1354983931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:32,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:32,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:32,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882785895] [2021-05-06 11:33:32,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:32,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:32,919 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-06 11:33:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:33,086 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-05-06 11:33:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 11:33:33,087 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-06 11:33:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:33,088 INFO L225 Difference]: With dead ends: 96 [2021-05-06 11:33:33,089 INFO L226 Difference]: Without dead ends: 94 [2021-05-06 11:33:33,089 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-06 11:33:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-06 11:33:33,106 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-06 11:33:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-06 11:33:33,107 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-06 11:33:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:33,107 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-06 11:33:33,108 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-06 11:33:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-06 11:33:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-06 11:33:33,108 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:33,108 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:33,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:33:33,109 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-06 11:33:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2021-05-06 11:33:33,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:33,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1311685931] [2021-05-06 11:33:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:33,111 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:33,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:33,193 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-06 11:33:33,193 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:33,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1311685931] [2021-05-06 11:33:33,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1311685931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:33,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:33,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:33,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776185209] [2021-05-06 11:33:33,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:33,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:33,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:33,198 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-06 11:33:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:33,470 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-05-06 11:33:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:33,471 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-06 11:33:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:33,472 INFO L225 Difference]: With dead ends: 95 [2021-05-06 11:33:33,472 INFO L226 Difference]: Without dead ends: 93 [2021-05-06 11:33:33,472 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 150.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-06 11:33:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-05-06 11:33:33,487 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-06 11:33:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-06 11:33:33,487 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-06 11:33:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:33,487 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-06 11:33:33,488 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-06 11:33:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-06 11:33:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-06 11:33:33,488 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:33,488 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:33,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:33:33,489 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-06 11:33:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2021-05-06 11:33:33,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:33,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278257061] [2021-05-06 11:33:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:33,491 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:33,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:33,537 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-06 11:33:33,537 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:33,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278257061] [2021-05-06 11:33:33,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1278257061] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:33,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:33,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:33,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988043466] [2021-05-06 11:33:33,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:33,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:33,539 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-06 11:33:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:33,715 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-06 11:33:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:33,715 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-06 11:33:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:33,716 INFO L225 Difference]: With dead ends: 69 [2021-05-06 11:33:33,716 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 11:33:33,716 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 11:33:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2021-05-06 11:33:33,730 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-06 11:33:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-06 11:33:33,730 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-06 11:33:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:33,730 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-06 11:33:33,731 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-06 11:33:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-06 11:33:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-06 11:33:33,731 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:33,731 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:33,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:33:33,731 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-06 11:33:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:33,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2021-05-06 11:33:33,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:33,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619863927] [2021-05-06 11:33:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:33,734 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:33,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:33,780 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-06 11:33:33,780 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:33,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619863927] [2021-05-06 11:33:33,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [619863927] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:33,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:33,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:33,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792199504] [2021-05-06 11:33:33,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:33,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:33,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:33,782 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-06 11:33:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:33,937 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2021-05-06 11:33:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 11:33:33,937 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-06 11:33:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:33,938 INFO L225 Difference]: With dead ends: 91 [2021-05-06 11:33:33,938 INFO L226 Difference]: Without dead ends: 89 [2021-05-06 11:33:33,938 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-06 11:33:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2021-05-06 11:33:33,951 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-06 11:33:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-06 11:33:33,951 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-06 11:33:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:33,952 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-06 11:33:33,952 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-06 11:33:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-06 11:33:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-06 11:33:33,952 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:33,952 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:33,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 11:33:33,953 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-06 11:33:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2021-05-06 11:33:33,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:33,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [833513960] [2021-05-06 11:33:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:33,955 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,021 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-06 11:33:34,021 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:34,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [833513960] [2021-05-06 11:33:34,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [833513960] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:34,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:34,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:34,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323289587] [2021-05-06 11:33:34,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:34,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:34,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:34,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:34,023 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-06 11:33:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:34,245 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-05-06 11:33:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:34,246 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-06 11:33:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:34,247 INFO L225 Difference]: With dead ends: 73 [2021-05-06 11:33:34,247 INFO L226 Difference]: Without dead ends: 71 [2021-05-06 11:33:34,247 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 154.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-06 11:33:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-05-06 11:33:34,259 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-06 11:33:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-06 11:33:34,260 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-06 11:33:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:34,260 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-06 11:33:34,260 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-06 11:33:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-06 11:33:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-06 11:33:34,261 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:34,261 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-06 11:33:34,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 11:33:34,261 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-06 11:33:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2021-05-06 11:33:34,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:34,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [728350226] [2021-05-06 11:33:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:34,263 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,315 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-06 11:33:34,315 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:34,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [728350226] [2021-05-06 11:33:34,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [728350226] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:34,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:34,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:34,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644205664] [2021-05-06 11:33:34,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:34,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:34,317 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-06 11:33:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:34,522 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-06 11:33:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:34,523 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-06 11:33:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:34,523 INFO L225 Difference]: With dead ends: 61 [2021-05-06 11:33:34,523 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 11:33:34,523 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 120.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 11:33:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-06 11:33:34,536 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-06 11:33:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-06 11:33:34,537 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-06 11:33:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:34,537 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-06 11:33:34,537 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-06 11:33:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-06 11:33:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-06 11:33:34,538 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:34,538 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-06 11:33:34,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 11:33:34,538 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-06 11:33:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2021-05-06 11:33:34,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:34,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486684633] [2021-05-06 11:33:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:34,540 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,585 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-06 11:33:34,585 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:34,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486684633] [2021-05-06 11:33:34,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [486684633] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:34,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:34,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:34,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031975641] [2021-05-06 11:33:34,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:34,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:34,586 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-06 11:33:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:34,699 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-06 11:33:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 11:33:34,699 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-06 11:33:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:34,700 INFO L225 Difference]: With dead ends: 61 [2021-05-06 11:33:34,700 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 11:33:34,700 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 11:33:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-06 11:33:34,714 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-06 11:33:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-06 11:33:34,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-06 11:33:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:34,714 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-06 11:33:34,714 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-06 11:33:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-06 11:33:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 11:33:34,715 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:34,715 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-06 11:33:34,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 11:33:34,715 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-06 11:33:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2021-05-06 11:33:34,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:34,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246121068] [2021-05-06 11:33:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:34,717 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:34,760 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-06 11:33:34,760 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:34,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246121068] [2021-05-06 11:33:34,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [246121068] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:34,761 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:34,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:34,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106670337] [2021-05-06 11:33:34,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:34,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:34,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:34,762 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-06 11:33:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:34,954 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-06 11:33:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:34,955 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-06 11:33:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:34,956 INFO L225 Difference]: With dead ends: 69 [2021-05-06 11:33:34,956 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 11:33:34,956 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 87.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 11:33:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-06 11:33:34,971 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-06 11:33:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-06 11:33:34,971 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-06 11:33:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:34,971 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-06 11:33:34,972 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-06 11:33:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-06 11:33:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 11:33:34,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:34,972 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-06 11:33:34,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-06 11:33:34,973 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-06 11:33:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2021-05-06 11:33:34,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:34,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850162915] [2021-05-06 11:33:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:34,975 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:35,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:35,021 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-06 11:33:35,022 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:35,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850162915] [2021-05-06 11:33:35,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1850162915] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:35,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:35,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:35,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922987848] [2021-05-06 11:33:35,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:35,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:35,023 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-06 11:33:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:35,262 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2021-05-06 11:33:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:35,262 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-06 11:33:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:35,263 INFO L225 Difference]: With dead ends: 74 [2021-05-06 11:33:35,263 INFO L226 Difference]: Without dead ends: 72 [2021-05-06 11:33:35,263 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-06 11:33:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-06 11:33:35,278 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-06 11:33:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-06 11:33:35,279 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-06 11:33:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:35,279 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-06 11:33:35,280 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-06 11:33:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-06 11:33:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:33:35,280 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:35,280 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-06 11:33:35,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 11:33:35,281 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-06 11:33:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2021-05-06 11:33:35,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:35,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [55189466] [2021-05-06 11:33:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:35,285 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:35,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:35,358 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-06 11:33:35,358 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:35,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [55189466] [2021-05-06 11:33:35,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [55189466] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:35,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:35,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:35,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698276821] [2021-05-06 11:33:35,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:35,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:35,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:35,360 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-06 11:33:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:35,632 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2021-05-06 11:33:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:33:35,632 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-06 11:33:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:35,634 INFO L225 Difference]: With dead ends: 62 [2021-05-06 11:33:35,634 INFO L226 Difference]: Without dead ends: 60 [2021-05-06 11:33:35,635 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 183.1ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-06 11:33:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-06 11:33:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-06 11:33:35,647 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-06 11:33:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-06 11:33:35,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-06 11:33:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:35,649 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-06 11:33:35,650 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-06 11:33:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-06 11:33:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-06 11:33:35,652 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:35,652 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-06 11:33:35,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-06 11:33:35,652 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-06 11:33:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2021-05-06 11:33:35,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:35,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291661858] [2021-05-06 11:33:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:35,657 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:35,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:35,708 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-06 11:33:35,708 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:35,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291661858] [2021-05-06 11:33:35,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [291661858] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:35,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:35,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:35,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299486079] [2021-05-06 11:33:35,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:35,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:35,709 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-06 11:33:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:35,990 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2021-05-06 11:33:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:35,991 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-06 11:33:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:35,991 INFO L225 Difference]: With dead ends: 87 [2021-05-06 11:33:35,991 INFO L226 Difference]: Without dead ends: 85 [2021-05-06 11:33:35,991 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 104.3ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-06 11:33:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-06 11:33:36,003 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-06 11:33:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-06 11:33:36,003 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-06 11:33:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:36,003 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-06 11:33:36,003 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-06 11:33:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-06 11:33:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 11:33:36,004 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:36,004 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-06 11:33:36,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 11:33:36,004 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-06 11:33:36,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:36,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2021-05-06 11:33:36,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:36,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452719382] [2021-05-06 11:33:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:36,006 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:36,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:36,062 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-06 11:33:36,063 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:36,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452719382] [2021-05-06 11:33:36,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [452719382] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:36,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:36,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:36,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407084716] [2021-05-06 11:33:36,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:36,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:36,064 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-06 11:33:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:36,344 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-06 11:33:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:33:36,344 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-06 11:33:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:36,345 INFO L225 Difference]: With dead ends: 60 [2021-05-06 11:33:36,345 INFO L226 Difference]: Without dead ends: 58 [2021-05-06 11:33:36,345 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 175.5ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-06 11:33:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-06 11:33:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-06 11:33:36,358 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-06 11:33:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-06 11:33:36,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-06 11:33:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:36,358 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-06 11:33:36,358 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-06 11:33:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-06 11:33:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-06 11:33:36,359 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:36,359 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-06 11:33:36,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 11:33:36,359 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-06 11:33:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2021-05-06 11:33:36,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:36,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902610279] [2021-05-06 11:33:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:36,361 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:36,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:36,412 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-06 11:33:36,413 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:36,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902610279] [2021-05-06 11:33:36,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1902610279] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:36,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:36,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:36,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090345218] [2021-05-06 11:33:36,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:36,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:36,414 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-06 11:33:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:36,857 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-05-06 11:33:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:33:36,858 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-06 11:33:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:36,858 INFO L225 Difference]: With dead ends: 125 [2021-05-06 11:33:36,858 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:33:36,859 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 149.8ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-06 11:33:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:33:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:33:36,859 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-06 11:33:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:33:36,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-06 11:33:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:36,860 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:33:36,860 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-06 11:33:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:33:36,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:33:36,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 11:33:36,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:33:37,238 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 129 [2021-05-06 11:33:37,488 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 134 [2021-05-06 11:33:37,634 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 137 [2021-05-06 11:33:37,800 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 145 [2021-05-06 11:33:37,971 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 137 [2021-05-06 11:33:38,132 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2021-05-06 11:33:38,312 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 132 [2021-05-06 11:33:38,504 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 113 [2021-05-06 11:33:38,782 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 156 [2021-05-06 11:33:38,973 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 136 [2021-05-06 11:33:39,209 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 146 [2021-05-06 11:33:39,320 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2021-05-06 11:33:39,847 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 30 [2021-05-06 11:33:40,017 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 18 [2021-05-06 11:33:40,184 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 42 [2021-05-06 11:33:40,378 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2021-05-06 11:33:40,557 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2021-05-06 11:33:40,771 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 32 [2021-05-06 11:33:40,924 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2021-05-06 11:33:41,053 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 13 [2021-05-06 11:33:41,277 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2021-05-06 11:33:41,458 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 25 [2021-05-06 11:33:41,610 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 38 [2021-05-06 11:33:41,792 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 28 [2021-05-06 11:33:41,952 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2021-05-06 11:33:42,278 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 26 [2021-05-06 11:33:42,435 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2021-05-06 11:33:42,604 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2021-05-06 11:33:42,674 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-06 11:33:42,674 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-06 11:33:42,674 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-06 11:33:42,674 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:42,675 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-06 11:33:42,675 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:42,675 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:42,675 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:33:42,675 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:33:42,675 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:42,675 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:42,675 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-06 11:33:42,675 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:42,675 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:42,675 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) the Hoare annotation is: false [2021-05-06 11:33:42,675 INFO L194 CegarLoopUtils]: At program point L217(line 217) the Hoare annotation is: false [2021-05-06 11:33:42,675 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 13 313) the Hoare annotation is: true [2021-05-06 11:33:42,675 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-06 11:33:42,676 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-06 11:33:42,676 INFO L194 CegarLoopUtils]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) the Hoare annotation is: false [2021-05-06 11:33:42,676 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-06 11:33:42,676 INFO L194 CegarLoopUtils]: At program point L193(line 193) the Hoare annotation is: false [2021-05-06 11:33:42,676 INFO L194 CegarLoopUtils]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) the Hoare annotation is: false [2021-05-06 11:33:42,676 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-06 11:33:42,676 INFO L194 CegarLoopUtils]: At program point L20(lines 20 312) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-06 11:33:42,676 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-06 11:33:42,676 INFO L194 CegarLoopUtils]: At program point L177(line 177) the Hoare annotation is: false [2021-05-06 11:33:42,677 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-06 11:33:42,677 INFO L194 CegarLoopUtils]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) the Hoare annotation is: false [2021-05-06 11:33:42,677 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-06 11:33:42,677 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-06 11:33:42,677 INFO L194 CegarLoopUtils]: At program point L153(line 153) the Hoare annotation is: false [2021-05-06 11:33:42,677 INFO L194 CegarLoopUtils]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) the Hoare annotation is: false [2021-05-06 11:33:42,677 INFO L194 CegarLoopUtils]: At program point L112(line 112) the Hoare annotation is: false [2021-05-06 11:33:42,677 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 13 313) the Hoare annotation is: true [2021-05-06 11:33:42,677 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-06 11:33:42,677 INFO L194 CegarLoopUtils]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) the Hoare annotation is: false [2021-05-06 11:33:42,678 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-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) the Hoare annotation is: false [2021-05-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 313) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point L88(line 88) the Hoare annotation is: false [2021-05-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point L245(line 245) the Hoare annotation is: false [2021-05-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: false [2021-05-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) the Hoare annotation is: false [2021-05-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point L229(line 229) the Hoare annotation is: false [2021-05-06 11:33:42,678 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-06 11:33:42,678 INFO L194 CegarLoopUtils]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) the Hoare annotation is: false [2021-05-06 11:33:42,679 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-06 11:33:42,679 INFO L194 CegarLoopUtils]: At program point L205(line 205) the Hoare annotation is: false [2021-05-06 11:33:42,679 INFO L194 CegarLoopUtils]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) the Hoare annotation is: false [2021-05-06 11:33:42,679 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-06 11:33:42,679 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-06 11:33:42,679 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) the Hoare annotation is: false [2021-05-06 11:33:42,679 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-06 11:33:42,679 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-06 11:33:42,680 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-06 11:33:42,680 INFO L194 CegarLoopUtils]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) the Hoare annotation is: false [2021-05-06 11:33:42,680 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-06 11:33:42,680 INFO L194 CegarLoopUtils]: At program point L165(line 165) the Hoare annotation is: false [2021-05-06 11:33:42,680 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-06 11:33:42,680 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) the Hoare annotation is: false [2021-05-06 11:33:42,680 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-06 11:33:42,680 INFO L194 CegarLoopUtils]: At program point L141(line 141) the Hoare annotation is: false [2021-05-06 11:33:42,680 INFO L194 CegarLoopUtils]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2021-05-06 11:33:42,681 INFO L194 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: false [2021-05-06 11:33:42,681 INFO L194 CegarLoopUtils]: At program point L257(line 257) the Hoare annotation is: false [2021-05-06 11:33:42,681 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-06 11:33:42,681 INFO L194 CegarLoopUtils]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) the Hoare annotation is: false [2021-05-06 11:33:42,681 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: false [2021-05-06 11:33:42,681 INFO L194 CegarLoopUtils]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) the Hoare annotation is: false [2021-05-06 11:33:42,681 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-06 11:33:42,681 INFO L194 CegarLoopUtils]: At program point L76(line 76) the Hoare annotation is: false [2021-05-06 11:33:42,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:33:42 BoogieIcfgContainer [2021-05-06 11:33:42,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:33:42,695 INFO L168 Benchmark]: Toolchain (without parser) took 12124.68 ms. Allocated memory was 185.6 MB in the beginning and 402.7 MB in the end (delta: 217.1 MB). Free memory was 150.9 MB in the beginning and 180.8 MB in the end (delta: -29.9 MB). Peak memory consumption was 231.3 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:42,695 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 185.6 MB. Free memory is still 167.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:33:42,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.29 ms. Allocated memory is still 185.6 MB. Free memory was 150.7 MB in the beginning and 166.0 MB in the end (delta: -15.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:42,696 INFO L168 Benchmark]: Boogie Preprocessor took 27.16 ms. Allocated memory is still 185.6 MB. Free memory was 166.0 MB in the beginning and 164.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:42,696 INFO L168 Benchmark]: RCFGBuilder took 469.46 ms. Allocated memory is still 185.6 MB. Free memory was 164.6 MB in the beginning and 140.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:42,696 INFO L168 Benchmark]: TraceAbstraction took 11344.47 ms. Allocated memory was 185.6 MB in the beginning and 402.7 MB in the end (delta: 217.1 MB). Free memory was 140.3 MB in the beginning and 180.8 MB in the end (delta: -40.6 MB). Peak memory consumption was 221.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:42,697 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.15 ms. Allocated memory is still 185.6 MB. Free memory is still 167.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 277.29 ms. Allocated memory is still 185.6 MB. Free memory was 150.7 MB in the beginning and 166.0 MB in the end (delta: -15.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 27.16 ms. Allocated memory is still 185.6 MB. Free memory was 166.0 MB in the beginning and 164.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 469.46 ms. Allocated memory is still 185.6 MB. Free memory was 164.6 MB in the beginning and 140.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11344.47 ms. Allocated memory was 185.6 MB in the beginning and 402.7 MB in the end (delta: 217.1 MB). Free memory was 140.3 MB in the beginning and 180.8 MB in the end (delta: -40.6 MB). Peak memory consumption was 221.6 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: 5438.0ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 21.7ms, AutomataDifference: 3752.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5813.2ms, InitialAbstractionConstructionTime: 31.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 941 SDtfs, 1948 SDslu, 201 SDs, 0 SdLazy, 1688 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1351.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1805.1ms 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: 253.9ms AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 65 LocationsWithAnnotation, 65 PreInvPairs, 189 NumberOfFragments, 1000 HoareAnnotationTreeSize, 65 FomulaSimplifications, 4033300448 FormulaSimplificationTreeSizeReduction, 2754.9ms HoareSimplificationTime, 65 FomulaSimplificationsInter, 5915929 FormulaSimplificationTreeSizeReductionInter, 3040.2ms 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...