/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 05:52:30,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 05:52:30,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 05:52:30,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 05:52:30,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 05:52:30,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 05:52:30,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 05:52:30,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 05:52:30,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 05:52:30,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 05:52:30,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 05:52:30,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 05:52:30,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 05:52:30,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 05:52:30,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 05:52:30,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 05:52:30,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 05:52:30,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 05:52:30,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 05:52:30,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 05:52:30,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 05:52:30,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 05:52:30,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 05:52:30,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 05:52:30,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 05:52:30,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 05:52:30,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 05:52:30,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 05:52:30,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 05:52:30,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 05:52:30,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 05:52:30,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 05:52:30,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 05:52:30,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 05:52:30,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 05:52:30,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 05:52:30,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 05:52:30,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 05:52:30,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 05:52:30,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 05:52:30,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 05:52:30,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-06 05:52:30,291 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 05:52:30,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 05:52:30,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 05:52:30,294 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 05:52:30,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 05:52:30,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 05:52:30,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 05:52:30,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 05:52:30,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 05:52:30,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 05:52:30,295 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 05:52:30,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 05:52:30,296 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 05:52:30,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 05:52:30,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 05:52:30,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 05:52:30,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 05:52:30,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 05:52:30,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 05:52:30,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 05:52:30,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-06 05:52:30,298 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-06 05:52:30,298 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 05:52:30,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 05:52:30,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 05:52:30,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 05:52:30,646 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 05:52:30,647 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 05:52:30,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-06 05:52:30,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b9175fa/f77543ed014f40b8a496534309121efb/FLAG13507ddf8 [2021-05-06 05:52:31,146 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 05:52:31,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-06 05:52:31,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b9175fa/f77543ed014f40b8a496534309121efb/FLAG13507ddf8 [2021-05-06 05:52:31,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b9175fa/f77543ed014f40b8a496534309121efb [2021-05-06 05:52:31,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 05:52:31,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-06 05:52:31,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 05:52:31,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 05:52:31,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 05:52:31,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da8de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31, skipping insertion in model container [2021-05-06 05:52:31,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 05:52:31,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 05:52:31,384 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-06 05:52:31,393 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-06 05:52:31,397 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/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-06 05:52:31,400 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/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-06 05:52:31,402 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/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-06 05:52:31,404 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/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-06 05:52:31,407 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/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-06 05:52:31,409 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/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-06 05:52:31,415 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/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-06 05:52:31,417 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/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-06 05:52:31,419 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/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-06 05:52:31,422 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/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-06 05:52:31,426 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/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-06 05:52:31,429 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/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-06 05:52:31,432 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/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-06 05:52:31,438 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/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-06 05:52:31,445 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/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-06 05:52:31,448 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/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-06 05:52:31,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:52:31,462 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 05:52:31,498 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/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-06 05:52:31,505 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/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-06 05:52:31,508 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/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-06 05:52:31,510 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/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-06 05:52:31,513 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/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-06 05:52:31,535 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/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-06 05:52:31,536 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/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-06 05:52:31,537 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/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-06 05:52:31,539 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/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-06 05:52:31,540 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/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-06 05:52:31,548 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/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-06 05:52:31,549 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/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-06 05:52:31,551 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/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-06 05:52:31,552 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/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-06 05:52:31,553 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/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-06 05:52:31,554 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/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-06 05:52:31,556 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/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-06 05:52:31,557 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/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-06 05:52:31,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:52:31,569 INFO L208 MainTranslator]: Completed translation [2021-05-06 05:52:31,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31 WrapperNode [2021-05-06 05:52:31,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 05:52:31,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 05:52:31,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 05:52:31,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 05:52:31,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (1/1) ... [2021-05-06 05:52:31,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 05:52:31,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 05:52:31,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 05:52:31,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 05:52:31,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (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 05:52:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 05:52:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 05:52:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 05:52:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 05:52:31,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 05:52:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 05:52:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 05:52:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 05:52:31,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 05:52:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 05:52:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 05:52:31,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 05:52:32,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 05:52:32,128 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-06 05:52:32,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:52:32 BoogieIcfgContainer [2021-05-06 05:52:32,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 05:52:32,130 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-06 05:52:32,130 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-06 05:52:32,130 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-06 05:52:32,132 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:52:32" (1/1) ... [2021-05-06 05:52:32,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:52:32 BasicIcfg [2021-05-06 05:52:32,169 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-06 05:52:32,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 05:52:32,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 05:52:32,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 05:52:32,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 05:52:31" (1/4) ... [2021-05-06 05:52:32,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b17e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:52:32, skipping insertion in model container [2021-05-06 05:52:32,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:31" (2/4) ... [2021-05-06 05:52:32,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b17e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:52:32, skipping insertion in model container [2021-05-06 05:52:32,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:52:32" (3/4) ... [2021-05-06 05:52:32,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b17e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:52:32, skipping insertion in model container [2021-05-06 05:52:32,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:52:32" (4/4) ... [2021-05-06 05:52:32,176 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.cJordan [2021-05-06 05:52:32,182 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-06 05:52:32,184 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-06 05:52:32,198 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-06 05:52:32,222 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 05:52:32,222 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-06 05:52:32,222 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-06 05:52:32,223 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 05:52:32,223 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 05:52:32,223 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 05:52:32,223 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 05:52:32,223 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 05:52:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 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 05:52:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-06 05:52:32,267 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:32,267 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 05:52:32,268 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash 317693851, now seen corresponding path program 1 times [2021-05-06 05:52:32,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:32,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120919428] [2021-05-06 05:52:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:32,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:32,470 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 05:52:32,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:32,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120919428] [2021-05-06 05:52:32,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120919428] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:32,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:32,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:52:32,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484927805] [2021-05-06 05:52:32,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:52:32,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:32,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:52:32,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:52:32,489 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 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 4.0) internal successors, (16), 3 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 05:52:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:32,597 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2021-05-06 05:52:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:52:32,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 05:52:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:32,604 INFO L225 Difference]: With dead ends: 87 [2021-05-06 05:52:32,604 INFO L226 Difference]: Without dead ends: 80 [2021-05-06 05:52:32,605 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-06 05:52:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-05-06 05:52:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 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 05:52:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-05-06 05:52:32,634 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2021-05-06 05:52:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:32,635 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-05-06 05:52:32,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 05:52:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-05-06 05:52:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 05:52:32,635 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:32,636 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 05:52:32,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 05:52:32,636 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1258576075, now seen corresponding path program 1 times [2021-05-06 05:52:32,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:32,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124229439] [2021-05-06 05:52:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:32,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:32,730 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 05:52:32,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:32,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124229439] [2021-05-06 05:52:32,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124229439] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:32,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:32,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 05:52:32,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126172528] [2021-05-06 05:52:32,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:32,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:32,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:32,733 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 05:52:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:33,010 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2021-05-06 05:52:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:33,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 05:52:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:33,012 INFO L225 Difference]: With dead ends: 78 [2021-05-06 05:52:33,012 INFO L226 Difference]: Without dead ends: 78 [2021-05-06 05:52:33,012 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 209.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-06 05:52:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-06 05:52:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 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 05:52:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-06 05:52:33,018 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2021-05-06 05:52:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:33,018 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-06 05:52:33,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 05:52:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-06 05:52:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 05:52:33,019 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:33,019 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 05:52:33,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 05:52:33,019 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1689129137, now seen corresponding path program 1 times [2021-05-06 05:52:33,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:33,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241576178] [2021-05-06 05:52:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:33,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:33,107 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 05:52:33,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:33,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241576178] [2021-05-06 05:52:33,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241576178] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:33,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:33,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:33,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156499967] [2021-05-06 05:52:33,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:33,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:33,109 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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 05:52:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:33,358 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-05-06 05:52:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:33,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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 05:52:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:33,366 INFO L225 Difference]: With dead ends: 99 [2021-05-06 05:52:33,366 INFO L226 Difference]: Without dead ends: 99 [2021-05-06 05:52:33,370 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 120.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 05:52:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-06 05:52:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2021-05-06 05:52:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 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 05:52:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-05-06 05:52:33,379 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2021-05-06 05:52:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:33,379 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-05-06 05:52:33,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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 05:52:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-05-06 05:52:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-06 05:52:33,380 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:33,380 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 05:52:33,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 05:52:33,380 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash -823394398, now seen corresponding path program 1 times [2021-05-06 05:52:33,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:33,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091567740] [2021-05-06 05:52:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:33,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:33,499 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 05:52:33,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:33,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091567740] [2021-05-06 05:52:33,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091567740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:33,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:33,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:33,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397545304] [2021-05-06 05:52:33,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:33,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:33,501 INFO L87 Difference]: Start difference. First operand 76 states and 79 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 05:52:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:33,667 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-05-06 05:52:33,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:33,667 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 05:52:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:33,668 INFO L225 Difference]: With dead ends: 74 [2021-05-06 05:52:33,668 INFO L226 Difference]: Without dead ends: 74 [2021-05-06 05:52:33,669 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-06 05:52:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-06 05:52:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-06 05:52:33,673 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2021-05-06 05:52:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:33,673 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-06 05:52:33,673 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 05:52:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-06 05:52:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-06 05:52:33,674 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:33,674 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, 1] [2021-05-06 05:52:33,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 05:52:33,674 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1183023144, now seen corresponding path program 1 times [2021-05-06 05:52:33,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:33,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669499694] [2021-05-06 05:52:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:33,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:33,782 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 05:52:33,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:33,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669499694] [2021-05-06 05:52:33,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669499694] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:33,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:33,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50490857] [2021-05-06 05:52:33,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:33,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:33,784 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 05:52:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:34,325 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2021-05-06 05:52:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 05:52:34,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2021-05-06 05:52:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:34,326 INFO L225 Difference]: With dead ends: 139 [2021-05-06 05:52:34,326 INFO L226 Difference]: Without dead ends: 139 [2021-05-06 05:52:34,327 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 260.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-06 05:52:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2021-05-06 05:52:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 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 05:52:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-06 05:52:34,337 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2021-05-06 05:52:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:34,337 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-06 05:52:34,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 05:52:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-06 05:52:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-06 05:52:34,338 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:34,338 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, 1] [2021-05-06 05:52:34,338 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 05:52:34,338 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:34,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1182992326, now seen corresponding path program 1 times [2021-05-06 05:52:34,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:34,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387334876] [2021-05-06 05:52:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:34,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:34,414 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 05:52:34,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:34,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387334876] [2021-05-06 05:52:34,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387334876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:34,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:34,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:34,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935700336] [2021-05-06 05:52:34,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:34,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:34,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:34,416 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 05:52:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:34,809 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-05-06 05:52:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 05:52:34,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2021-05-06 05:52:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:34,810 INFO L225 Difference]: With dead ends: 106 [2021-05-06 05:52:34,810 INFO L226 Difference]: Without dead ends: 106 [2021-05-06 05:52:34,810 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 255.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-06 05:52:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-05-06 05:52:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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 05:52:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-05-06 05:52:34,814 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2021-05-06 05:52:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:34,814 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-05-06 05:52:34,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 05:52:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-05-06 05:52:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 05:52:34,815 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:34,815 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, 1, 1] [2021-05-06 05:52:34,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 05:52:34,816 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1980989516, now seen corresponding path program 1 times [2021-05-06 05:52:34,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:34,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465950129] [2021-05-06 05:52:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:34,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:34,886 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 05:52:34,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:34,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465950129] [2021-05-06 05:52:34,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465950129] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:34,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:34,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:34,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531392891] [2021-05-06 05:52:34,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:34,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:34,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:34,888 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 05:52:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:35,198 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2021-05-06 05:52:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:35,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2021-05-06 05:52:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:35,199 INFO L225 Difference]: With dead ends: 119 [2021-05-06 05:52:35,199 INFO L226 Difference]: Without dead ends: 119 [2021-05-06 05:52:35,200 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 179.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-06 05:52:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2021-05-06 05:52:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 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 05:52:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-06 05:52:35,203 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2021-05-06 05:52:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:35,204 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-06 05:52:35,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 05:52:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-06 05:52:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 05:52:35,205 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:35,205 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, 1, 1] [2021-05-06 05:52:35,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 05:52:35,205 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1981944876, now seen corresponding path program 1 times [2021-05-06 05:52:35,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:35,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44943132] [2021-05-06 05:52:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:35,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:35,304 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 05:52:35,304 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:35,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44943132] [2021-05-06 05:52:35,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44943132] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:35,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:35,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:35,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185853382] [2021-05-06 05:52:35,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:35,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:35,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:35,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:35,306 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 05:52:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:35,517 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-05-06 05:52:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:35,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2021-05-06 05:52:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:35,521 INFO L225 Difference]: With dead ends: 75 [2021-05-06 05:52:35,522 INFO L226 Difference]: Without dead ends: 75 [2021-05-06 05:52:35,522 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 190.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-06 05:52:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-06 05:52:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 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 05:52:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-05-06 05:52:35,527 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2021-05-06 05:52:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:35,527 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-05-06 05:52:35,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 05:52:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-05-06 05:52:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-06 05:52:35,528 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:35,528 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, 1, 1, 1, 1] [2021-05-06 05:52:35,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 05:52:35,528 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1978555952, now seen corresponding path program 1 times [2021-05-06 05:52:35,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:35,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754821577] [2021-05-06 05:52:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:35,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:35,594 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 05:52:35,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:35,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754821577] [2021-05-06 05:52:35,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754821577] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:35,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:35,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:52:35,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237352473] [2021-05-06 05:52:35,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:52:35,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:52:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:52:35,595 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 05:52:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:35,716 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-05-06 05:52:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 05:52:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2021-05-06 05:52:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:35,717 INFO L225 Difference]: With dead ends: 79 [2021-05-06 05:52:35,717 INFO L226 Difference]: Without dead ends: 75 [2021-05-06 05:52:35,717 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-06 05:52:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-06 05:52:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 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 05:52:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-06 05:52:35,720 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2021-05-06 05:52:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:35,720 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-06 05:52:35,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 05:52:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-06 05:52:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-06 05:52:35,721 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:35,721 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, 1, 1, 1, 1, 1] [2021-05-06 05:52:35,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 05:52:35,721 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1860757727, now seen corresponding path program 1 times [2021-05-06 05:52:35,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:35,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597859882] [2021-05-06 05:52:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:35,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:35,802 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 05:52:35,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:35,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597859882] [2021-05-06 05:52:35,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597859882] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:35,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:35,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:35,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117328180] [2021-05-06 05:52:35,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:35,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:35,805 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 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 05:52:36,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:36,004 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-05-06 05:52:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:36,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2021-05-06 05:52:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:36,005 INFO L225 Difference]: With dead ends: 74 [2021-05-06 05:52:36,006 INFO L226 Difference]: Without dead ends: 74 [2021-05-06 05:52:36,006 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 155.9ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:52:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-06 05:52:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-06 05:52:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 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 05:52:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-06 05:52:36,008 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2021-05-06 05:52:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:36,008 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-06 05:52:36,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 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 05:52:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-06 05:52:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-06 05:52:36,009 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:36,009 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 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, 1] [2021-05-06 05:52:36,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 05:52:36,009 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1486248991, now seen corresponding path program 1 times [2021-05-06 05:52:36,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:36,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408282905] [2021-05-06 05:52:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:36,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 05:52:36,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:36,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408282905] [2021-05-06 05:52:36,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408282905] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:52:36,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471243962] [2021-05-06 05:52:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:52:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:36,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 05:52:36,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:52:36,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:36,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:36,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:36,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 05:52:36,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471243962] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:52:36,390 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:52:36,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-06 05:52:36,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648684602] [2021-05-06 05:52:36,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:36,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:36,391 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:36,667 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-05-06 05:52:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-06 05:52:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:36,669 INFO L225 Difference]: With dead ends: 109 [2021-05-06 05:52:36,669 INFO L226 Difference]: Without dead ends: 109 [2021-05-06 05:52:36,669 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 186.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-06 05:52:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2021-05-06 05:52:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-06 05:52:36,672 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2021-05-06 05:52:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:36,673 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-06 05:52:36,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-06 05:52:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-06 05:52:36,676 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:36,676 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, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:36,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-05-06 05:52:36,897 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1848916017, now seen corresponding path program 1 times [2021-05-06 05:52:36,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:36,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530259353] [2021-05-06 05:52:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:36,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:36,960 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 05:52:36,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:36,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530259353] [2021-05-06 05:52:36,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530259353] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:36,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:36,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:36,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987179372] [2021-05-06 05:52:36,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:36,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:36,961 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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 05:52:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:37,114 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-05-06 05:52:37,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:37,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2021-05-06 05:52:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:37,115 INFO L225 Difference]: With dead ends: 68 [2021-05-06 05:52:37,115 INFO L226 Difference]: Without dead ends: 68 [2021-05-06 05:52:37,115 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-06 05:52:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-06 05:52:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-06 05:52:37,117 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2021-05-06 05:52:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:37,117 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-06 05:52:37,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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 05:52:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-06 05:52:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-06 05:52:37,136 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:37,136 INFO L523 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2021-05-06 05:52:37,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 05:52:37,137 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1170891010, now seen corresponding path program 1 times [2021-05-06 05:52:37,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:37,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478941020] [2021-05-06 05:52:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:37,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 05:52:37,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:37,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478941020] [2021-05-06 05:52:37,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478941020] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:52:37,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372541518] [2021-05-06 05:52:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:52:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:37,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-06 05:52:37,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:52:37,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:37,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:37,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:37,402 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-06 05:52:37,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372541518] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:52:37,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:52:37,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-06 05:52:37,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592889535] [2021-05-06 05:52:37,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:37,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:37,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:37,422 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:37,609 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-05-06 05:52:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-06 05:52:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:37,610 INFO L225 Difference]: With dead ends: 67 [2021-05-06 05:52:37,610 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 05:52:37,610 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 152.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 05:52:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-05-06 05:52:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-05-06 05:52:37,612 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2021-05-06 05:52:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:37,613 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-05-06 05:52:37,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-05-06 05:52:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-06 05:52:37,613 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:37,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:37,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-06 05:52:37,829 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1897188956, now seen corresponding path program 1 times [2021-05-06 05:52:37,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:37,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873055969] [2021-05-06 05:52:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:37,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:37,900 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 05:52:37,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:37,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873055969] [2021-05-06 05:52:37,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873055969] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:37,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:37,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:37,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262593477] [2021-05-06 05:52:37,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:37,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:37,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:37,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:37,905 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 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 05:52:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:38,089 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-05-06 05:52:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:38,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2021-05-06 05:52:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:38,090 INFO L225 Difference]: With dead ends: 61 [2021-05-06 05:52:38,090 INFO L226 Difference]: Without dead ends: 61 [2021-05-06 05:52:38,091 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 145.1ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:52:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-06 05:52:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-06 05:52:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 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 05:52:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-05-06 05:52:38,093 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2021-05-06 05:52:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:38,094 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-05-06 05:52:38,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 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 05:52:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-05-06 05:52:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-06 05:52:38,095 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:38,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:38,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 05:52:38,097 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1316685848, now seen corresponding path program 1 times [2021-05-06 05:52:38,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:38,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318560609] [2021-05-06 05:52:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:38,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:38,188 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 05:52:38,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:38,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318560609] [2021-05-06 05:52:38,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318560609] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:38,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:38,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 05:52:38,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877840262] [2021-05-06 05:52:38,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:38,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:38,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:38,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:38,189 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 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 05:52:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:38,440 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-05-06 05:52:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2021-05-06 05:52:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:38,441 INFO L225 Difference]: With dead ends: 69 [2021-05-06 05:52:38,441 INFO L226 Difference]: Without dead ends: 69 [2021-05-06 05:52:38,441 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 158.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-06 05:52:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-05-06 05:52:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 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 05:52:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-05-06 05:52:38,443 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2021-05-06 05:52:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:38,443 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-05-06 05:52:38,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 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 05:52:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-05-06 05:52:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-06 05:52:38,444 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:38,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:38,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 05:52:38,444 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash -546914678, now seen corresponding path program 1 times [2021-05-06 05:52:38,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:38,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13317279] [2021-05-06 05:52:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:38,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:38,509 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 05:52:38,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:38,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13317279] [2021-05-06 05:52:38,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13317279] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:38,509 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:38,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:38,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475213996] [2021-05-06 05:52:38,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:38,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:38,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:38,510 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 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 05:52:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:38,850 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-05-06 05:52:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 05:52:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 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 38 [2021-05-06 05:52:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:38,852 INFO L225 Difference]: With dead ends: 89 [2021-05-06 05:52:38,852 INFO L226 Difference]: Without dead ends: 89 [2021-05-06 05:52:38,852 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 218.4ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-06 05:52:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2021-05-06 05:52:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 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 05:52:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-06 05:52:38,854 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2021-05-06 05:52:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:38,854 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-06 05:52:38,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 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 05:52:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-06 05:52:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-06 05:52:38,854 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:38,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:38,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 05:52:38,855 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 225515518, now seen corresponding path program 1 times [2021-05-06 05:52:38,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:38,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620184777] [2021-05-06 05:52:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:38,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:38,929 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 05:52:38,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:38,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620184777] [2021-05-06 05:52:38,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620184777] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:38,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:38,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:38,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560770215] [2021-05-06 05:52:38,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:38,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:38,931 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 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 05:52:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:39,198 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-05-06 05:52:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:39,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 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 39 [2021-05-06 05:52:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:39,199 INFO L225 Difference]: With dead ends: 59 [2021-05-06 05:52:39,199 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 05:52:39,200 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 202.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 05:52:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-06 05:52:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-06 05:52:39,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2021-05-06 05:52:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:39,202 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-06 05:52:39,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 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 05:52:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-06 05:52:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-06 05:52:39,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:39,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:39,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-06 05:52:39,202 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1972090370, now seen corresponding path program 1 times [2021-05-06 05:52:39,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:39,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239779315] [2021-05-06 05:52:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:39,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:39,266 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 05:52:39,267 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:39,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239779315] [2021-05-06 05:52:39,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239779315] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:39,267 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:39,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:39,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590874115] [2021-05-06 05:52:39,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:39,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:39,269 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 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 05:52:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:39,439 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-05-06 05:52:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:39,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 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 41 [2021-05-06 05:52:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:39,440 INFO L225 Difference]: With dead ends: 68 [2021-05-06 05:52:39,440 INFO L226 Difference]: Without dead ends: 68 [2021-05-06 05:52:39,440 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 109.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 05:52:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-06 05:52:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2021-05-06 05:52:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-06 05:52:39,442 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2021-05-06 05:52:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:39,443 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-06 05:52:39,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 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 05:52:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-06 05:52:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-06 05:52:39,443 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:39,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:39,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-06 05:52:39,443 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1005260689, now seen corresponding path program 1 times [2021-05-06 05:52:39,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:39,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32787775] [2021-05-06 05:52:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:39,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:39,502 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 05:52:39,502 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:39,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32787775] [2021-05-06 05:52:39,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32787775] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:39,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:39,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:39,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037441391] [2021-05-06 05:52:39,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:39,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:39,503 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 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 05:52:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:39,698 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-05-06 05:52:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:39,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 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 42 [2021-05-06 05:52:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:39,699 INFO L225 Difference]: With dead ends: 64 [2021-05-06 05:52:39,699 INFO L226 Difference]: Without dead ends: 64 [2021-05-06 05:52:39,699 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 102.2ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-06 05:52:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-05-06 05:52:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-06 05:52:39,701 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2021-05-06 05:52:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:39,701 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-06 05:52:39,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 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 05:52:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-06 05:52:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-06 05:52:39,702 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:39,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:39,702 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-06 05:52:39,702 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1098311654, now seen corresponding path program 1 times [2021-05-06 05:52:39,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:39,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634757788] [2021-05-06 05:52:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:39,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:39,767 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 05:52:39,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:39,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634757788] [2021-05-06 05:52:39,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634757788] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:39,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:39,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:39,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381267028] [2021-05-06 05:52:39,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:39,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:39,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:39,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:39,769 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 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 05:52:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:40,137 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2021-05-06 05:52:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 05:52:40,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 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 43 [2021-05-06 05:52:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:40,138 INFO L225 Difference]: With dead ends: 86 [2021-05-06 05:52:40,138 INFO L226 Difference]: Without dead ends: 86 [2021-05-06 05:52:40,138 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 228.7ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-06 05:52:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2021-05-06 05:52:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 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 05:52:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-06 05:52:40,140 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2021-05-06 05:52:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:40,140 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-06 05:52:40,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 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 05:52:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-06 05:52:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-06 05:52:40,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:40,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:40,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-06 05:52:40,141 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash -312075723, now seen corresponding path program 1 times [2021-05-06 05:52:40,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:40,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441499287] [2021-05-06 05:52:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:40,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:40,217 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 05:52:40,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:40,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441499287] [2021-05-06 05:52:40,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441499287] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:40,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:40,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:40,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479608749] [2021-05-06 05:52:40,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:40,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:40,219 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 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 05:52:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:40,460 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-05-06 05:52:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 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 44 [2021-05-06 05:52:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:40,461 INFO L225 Difference]: With dead ends: 71 [2021-05-06 05:52:40,461 INFO L226 Difference]: Without dead ends: 71 [2021-05-06 05:52:40,462 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 170.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-06 05:52:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2021-05-06 05:52:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-06 05:52:40,463 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2021-05-06 05:52:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:40,464 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-06 05:52:40,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 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 05:52:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-06 05:52:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-06 05:52:40,464 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:40,464 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:40,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-06 05:52:40,464 INFO L428 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:40,465 INFO L82 PathProgramCache]: Analyzing trace with hash -283140749, now seen corresponding path program 1 times [2021-05-06 05:52:40,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:40,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796945275] [2021-05-06 05:52:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:40,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:52:40,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:40,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796945275] [2021-05-06 05:52:40,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796945275] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:52:40,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100948589] [2021-05-06 05:52:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-06 05:52:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:40,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-06 05:52:40,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-06 05:52:40,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:40,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:40,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:40,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:40,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:40,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 05:52:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 05:52:40,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100948589] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-06 05:52:40,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-06 05:52:40,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-06 05:52:40,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274480559] [2021-05-06 05:52:40,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:40,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:40,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:40,761 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:40,920 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-05-06 05:52:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-06 05:52:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:40,922 INFO L225 Difference]: With dead ends: 56 [2021-05-06 05:52:40,922 INFO L226 Difference]: Without dead ends: 56 [2021-05-06 05:52:40,923 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 05:52:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-06 05:52:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-05-06 05:52:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-06 05:52:40,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-05-06 05:52:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:40,924 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-06 05:52:40,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-06 05:52:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 05:52:40,925 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:40,925 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:41,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-05-06 05:52:41,126 INFO L428 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 05:52:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1506676067, now seen corresponding path program 1 times [2021-05-06 05:52:41,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:41,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661228335] [2021-05-06 05:52:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:41,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-06 05:52:41,232 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:41,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661228335] [2021-05-06 05:52:41,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661228335] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:41,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:41,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:41,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781724130] [2021-05-06 05:52:41,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:41,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:41,233 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 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 05:52:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:41,545 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-05-06 05:52:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 05:52:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 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 49 [2021-05-06 05:52:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:41,546 INFO L225 Difference]: With dead ends: 73 [2021-05-06 05:52:41,546 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 05:52:41,546 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 265.6ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-06 05:52:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 05:52:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 05:52:41,547 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 05:52:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 05:52:41,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-05-06 05:52:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:41,547 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 05:52:41,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 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 05:52:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 05:52:41,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 05:52:41,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-06 05:52:41,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:52:41 BasicIcfg [2021-05-06 05:52:41,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 05:52:41,551 INFO L168 Benchmark]: Toolchain (without parser) took 10368.72 ms. Allocated memory was 203.4 MB in the beginning and 370.1 MB in the end (delta: 166.7 MB). Free memory was 169.0 MB in the beginning and 274.4 MB in the end (delta: -105.4 MB). Peak memory consumption was 62.3 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:41,551 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 203.4 MB. Free memory was 185.8 MB in the beginning and 185.7 MB in the end (delta: 89.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 05:52:41,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.01 ms. Allocated memory is still 203.4 MB. Free memory was 168.8 MB in the beginning and 182.2 MB in the end (delta: -13.4 MB). Peak memory consumption was 16.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:41,551 INFO L168 Benchmark]: Boogie Preprocessor took 31.16 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 180.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:41,551 INFO L168 Benchmark]: RCFGBuilder took 526.54 ms. Allocated memory is still 203.4 MB. Free memory was 180.1 MB in the beginning and 150.2 MB in the end (delta: 29.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:41,551 INFO L168 Benchmark]: IcfgTransformer took 39.23 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 148.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:41,551 INFO L168 Benchmark]: TraceAbstraction took 9380.15 ms. Allocated memory was 203.4 MB in the beginning and 370.1 MB in the end (delta: 166.7 MB). Free memory was 148.1 MB in the beginning and 274.4 MB in the end (delta: -126.2 MB). Peak memory consumption was 41.0 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:41,552 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.13 ms. Allocated memory is still 203.4 MB. Free memory was 185.8 MB in the beginning and 185.7 MB in the end (delta: 89.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 384.01 ms. Allocated memory is still 203.4 MB. Free memory was 168.8 MB in the beginning and 182.2 MB in the end (delta: -13.4 MB). Peak memory consumption was 16.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.16 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 180.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 526.54 ms. Allocated memory is still 203.4 MB. Free memory was 180.1 MB in the beginning and 150.2 MB in the end (delta: 29.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 8.0 GB. * IcfgTransformer took 39.23 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 148.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9380.15 ms. Allocated memory was 203.4 MB in the beginning and 370.1 MB in the end (delta: 166.7 MB). Free memory was 148.1 MB in the beginning and 274.4 MB in the end (delta: -126.2 MB). Peak memory consumption was 41.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: 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: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: 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 3 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9328.1ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 30.8ms, AutomataDifference: 5754.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1304 SDtfs, 3786 SDslu, 287 SDs, 0 SdLazy, 2588 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2104.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 171 SyntacticMatches, 11 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3781.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 85.1ms AutomataMinimizationTime, 23 MinimizatonAttempts, 298 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 87.7ms SsaConstructionTime, 309.3ms SatisfiabilityAnalysisTime, 2048.0ms InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 2458 SizeOfPredicates, 12 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...