java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:24,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:24,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:24,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:24,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:24,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:24,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:24,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:24,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:24,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:24,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:24,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:24,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:24,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:24,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:24,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:24,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:24,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:24,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:24,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:24,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:24,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:24,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:24,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:24,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:24,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:24,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:24,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:24,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:24,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:24,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:24,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:24,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:24,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:24,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:24,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:24,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:24,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:24,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:24,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:24,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:24,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:07:24,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:24,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:24,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:24,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:24,604 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:24,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:24,605 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:24,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:24,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:24,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:24,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:24,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:24,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:24,606 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:24,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:24,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:24,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:24,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:24,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:24,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:24,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:24,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:24,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:24,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:24,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:24,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:24,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:24,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:24,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:24,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:24,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:24,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:24,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:24,930 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:24,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2019-10-14 22:07:25,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7e5d4fd/535c13976c1a4f70a04b800383607d05/FLAG0e9f806d6 [2019-10-14 22:07:25,543 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:25,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2019-10-14 22:07:25,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7e5d4fd/535c13976c1a4f70a04b800383607d05/FLAG0e9f806d6 [2019-10-14 22:07:25,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7e5d4fd/535c13976c1a4f70a04b800383607d05 [2019-10-14 22:07:25,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:25,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:25,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:25,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:25,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:25,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:25" (1/1) ... [2019-10-14 22:07:25,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8bf277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:25, skipping insertion in model container [2019-10-14 22:07:25,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:25" (1/1) ... [2019-10-14 22:07:25,840 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:25,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:26,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:26,418 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:26,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:26,519 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:26,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26 WrapperNode [2019-10-14 22:07:26,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:26,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:26,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:26,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:26,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (1/1) ... [2019-10-14 22:07:26,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:26,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:26,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:26,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:26,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (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 [2019-10-14 22:07:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:26,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:26,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:27,314 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:27,314 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-14 22:07:27,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:27 BoogieIcfgContainer [2019-10-14 22:07:27,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:27,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:27,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:27,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:27,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:25" (1/3) ... [2019-10-14 22:07:27,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b19f9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:27, skipping insertion in model container [2019-10-14 22:07:27,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:26" (2/3) ... [2019-10-14 22:07:27,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b19f9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:27, skipping insertion in model container [2019-10-14 22:07:27,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:27" (3/3) ... [2019-10-14 22:07:27,324 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-10-14 22:07:27,333 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:27,341 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-14 22:07:27,353 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-14 22:07:27,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:27,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:27,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:27,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:27,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:27,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:27,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:27,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-14 22:07:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 22:07:27,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:27,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:27,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993325, now seen corresponding path program 1 times [2019-10-14 22:07:27,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:27,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300278151] [2019-10-14 22:07:27,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:27,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:27,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:27,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300278151] [2019-10-14 22:07:27,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:27,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:27,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135433293] [2019-10-14 22:07:27,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:27,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:27,622 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-10-14 22:07:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:27,767 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2019-10-14 22:07:27,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:27,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-14 22:07:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:27,779 INFO L225 Difference]: With dead ends: 76 [2019-10-14 22:07:27,779 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 22:07:27,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 22:07:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-14 22:07:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 22:07:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-10-14 22:07:27,841 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 11 [2019-10-14 22:07:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:27,841 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-10-14 22:07:27,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-10-14 22:07:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:07:27,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:27,842 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:27,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:27,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1902233848, now seen corresponding path program 1 times [2019-10-14 22:07:27,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:27,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44932521] [2019-10-14 22:07:27,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:27,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:27,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:27,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44932521] [2019-10-14 22:07:27,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:27,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:27,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933400018] [2019-10-14 22:07:27,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:27,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:27,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:27,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:27,976 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 6 states. [2019-10-14 22:07:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:28,240 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-10-14 22:07:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:28,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-14 22:07:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:28,243 INFO L225 Difference]: With dead ends: 75 [2019-10-14 22:07:28,243 INFO L226 Difference]: Without dead ends: 49 [2019-10-14 22:07:28,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-14 22:07:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-10-14 22:07:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 22:07:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-14 22:07:28,261 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 14 [2019-10-14 22:07:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:28,262 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-14 22:07:28,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-14 22:07:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:07:28,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:28,265 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:28,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1902292180, now seen corresponding path program 1 times [2019-10-14 22:07:28,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:28,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393728002] [2019-10-14 22:07:28,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:28,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:28,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:28,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393728002] [2019-10-14 22:07:28,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:28,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:07:28,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381944471] [2019-10-14 22:07:28,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:07:28,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:07:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:07:28,388 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2019-10-14 22:07:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:28,531 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-10-14 22:07:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 22:07:28,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-14 22:07:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:28,533 INFO L225 Difference]: With dead ends: 68 [2019-10-14 22:07:28,533 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 22:07:28,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 22:07:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-10-14 22:07:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 22:07:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-10-14 22:07:28,543 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2019-10-14 22:07:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:28,544 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-10-14 22:07:28,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:07:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-10-14 22:07:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 22:07:28,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:28,545 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:28,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -202034517, now seen corresponding path program 1 times [2019-10-14 22:07:28,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:28,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417986778] [2019-10-14 22:07:28,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:28,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:28,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:28,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417986778] [2019-10-14 22:07:28,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661148229] [2019-10-14 22:07:28,653 INFO L94 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 [2019-10-14 22:07:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:28,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 22:07:28,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:28,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:28,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-10-14 22:07:28,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-10-14 22:07:28,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:28,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-10-14 22:07:28,950 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-14 22:07:28,955 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:28,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:28,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:28,963 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-10-14 22:07:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:28,973 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:28,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 22:07:28,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699029484] [2019-10-14 22:07:28,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:28,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:28,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:28,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:28,976 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 7 states. [2019-10-14 22:07:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:29,281 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-10-14 22:07:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:07:29,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-14 22:07:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:29,284 INFO L225 Difference]: With dead ends: 54 [2019-10-14 22:07:29,285 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 22:07:29,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 22:07:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-10-14 22:07:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 22:07:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-14 22:07:29,293 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 22 [2019-10-14 22:07:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:29,295 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-14 22:07:29,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-14 22:07:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:07:29,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:29,297 INFO L380 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] [2019-10-14 22:07:29,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:29,498 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1078104211, now seen corresponding path program 1 times [2019-10-14 22:07:29,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:29,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988602387] [2019-10-14 22:07:29,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:29,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:29,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:29,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988602387] [2019-10-14 22:07:29,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538972688] [2019-10-14 22:07:29,682 INFO L94 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 [2019-10-14 22:07:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:29,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 22:07:29,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:29,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:29,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:29,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:29,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 22:07:29,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:29,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:29,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,886 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 22:07:29,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:29,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:29,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:29,903 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:28 [2019-10-14 22:07:29,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:29,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-14 22:07:29,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:30,014 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-14 22:07:30,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:30,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:9 [2019-10-14 22:07:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:30,033 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:30,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-10-14 22:07:30,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342470185] [2019-10-14 22:07:30,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:07:30,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:07:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:07:30,036 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 11 states. [2019-10-14 22:07:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:30,736 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2019-10-14 22:07:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:07:30,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-10-14 22:07:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:30,738 INFO L225 Difference]: With dead ends: 119 [2019-10-14 22:07:30,739 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 22:07:30,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 22:07:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 59. [2019-10-14 22:07:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 22:07:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2019-10-14 22:07:30,754 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 24 [2019-10-14 22:07:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:30,754 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2019-10-14 22:07:30,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:07:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2019-10-14 22:07:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 22:07:30,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:30,755 INFO L380 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] [2019-10-14 22:07:30,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:30,962 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash -398045841, now seen corresponding path program 1 times [2019-10-14 22:07:30,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:30,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211627331] [2019-10-14 22:07:30,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:30,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:30,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:07:31,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211627331] [2019-10-14 22:07:31,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:31,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:31,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030948980] [2019-10-14 22:07:31,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:31,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:31,062 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 6 states. [2019-10-14 22:07:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:31,231 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-10-14 22:07:31,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:07:31,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-14 22:07:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:31,232 INFO L225 Difference]: With dead ends: 79 [2019-10-14 22:07:31,232 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 22:07:31,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 22:07:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-14 22:07:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 22:07:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-10-14 22:07:31,243 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 24 [2019-10-14 22:07:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:31,243 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-10-14 22:07:31,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-10-14 22:07:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:31,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:31,244 INFO L380 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] [2019-10-14 22:07:31,245 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:31,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1761635681, now seen corresponding path program 2 times [2019-10-14 22:07:31,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:31,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177421656] [2019-10-14 22:07:31,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:31,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:31,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:31,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177421656] [2019-10-14 22:07:31,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392923992] [2019-10-14 22:07:31,588 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-10-14 22:07:31,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:31,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:31,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-14 22:07:31,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:31,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:31,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:31,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:31,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-14 22:07:31,796 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:31,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,855 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|], 2=[|v_#memory_int_28|, |v_#memory_int_29|, |v_#memory_int_31|]} [2019-10-14 22:07:31,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:31,865 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,895 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:31,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,920 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:31,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:31,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-10-14 22:07:31,950 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:31,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:31,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:31,971 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:104, output treesize:45 [2019-10-14 22:07:32,061 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_29|], 4=[|v_#memory_int_32|]} [2019-10-14 22:07:32,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-10-14 22:07:32,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,097 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-10-14 22:07:32,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-10-14 22:07:32,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:32,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:24 [2019-10-14 22:07:32,155 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_30|], 6=[|v_#memory_int_33|]} [2019-10-14 22:07:32,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:32,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:32,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,216 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 22:07:32,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-10-14 22:07:32,218 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,236 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:27 [2019-10-14 22:07:32,287 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-10-14 22:07:32,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-10-14 22:07:32,290 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:32,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-10-14 22:07:32,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:32,310 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:32,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:32,318 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2019-10-14 22:07:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:32,322 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:32,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-10-14 22:07:32,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211757820] [2019-10-14 22:07:32,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:32,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:32,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:32,323 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 17 states. [2019-10-14 22:07:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:32,885 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2019-10-14 22:07:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:07:32,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-10-14 22:07:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:32,888 INFO L225 Difference]: With dead ends: 101 [2019-10-14 22:07:32,888 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 22:07:32,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-10-14 22:07:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 22:07:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2019-10-14 22:07:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 22:07:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-10-14 22:07:32,899 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2019-10-14 22:07:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:32,899 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-10-14 22:07:32,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-10-14 22:07:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:32,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:32,901 INFO L380 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] [2019-10-14 22:07:33,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:33,105 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:33,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1761633759, now seen corresponding path program 1 times [2019-10-14 22:07:33,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:33,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75930962] [2019-10-14 22:07:33,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 22:07:33,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75930962] [2019-10-14 22:07:33,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:33,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 22:07:33,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2192399] [2019-10-14 22:07:33,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 22:07:33,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 22:07:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:33,156 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 4 states. [2019-10-14 22:07:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:33,233 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-10-14 22:07:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 22:07:33,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-10-14 22:07:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:33,235 INFO L225 Difference]: With dead ends: 80 [2019-10-14 22:07:33,235 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 22:07:33,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 22:07:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 22:07:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2019-10-14 22:07:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 22:07:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-10-14 22:07:33,258 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2019-10-14 22:07:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:33,259 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-10-14 22:07:33,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 22:07:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-10-14 22:07:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 22:07:33,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:33,263 INFO L380 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:33,264 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1476274771, now seen corresponding path program 3 times [2019-10-14 22:07:33,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:33,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474712334] [2019-10-14 22:07:33,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:33,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474712334] [2019-10-14 22:07:33,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212788430] [2019-10-14 22:07:33,416 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:33,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:07:33,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:33,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-14 22:07:33,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:33,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:33,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:33,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:33,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2019-10-14 22:07:33,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2019-10-14 22:07:33,746 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,758 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:41 [2019-10-14 22:07:33,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-10-14 22:07:33,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2019-10-14 22:07:33,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,878 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-10-14 22:07:33,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:18 [2019-10-14 22:07:33,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:33,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:33,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:33,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:33,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 22:07:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:33,930 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:33,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-14 22:07:33,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617622793] [2019-10-14 22:07:33,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 22:07:33,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 22:07:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-14 22:07:33,932 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 14 states. [2019-10-14 22:07:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:34,690 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2019-10-14 22:07:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:07:34,691 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-10-14 22:07:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:34,692 INFO L225 Difference]: With dead ends: 128 [2019-10-14 22:07:34,692 INFO L226 Difference]: Without dead ends: 94 [2019-10-14 22:07:34,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-14 22:07:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2019-10-14 22:07:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-14 22:07:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-10-14 22:07:34,704 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 26 [2019-10-14 22:07:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:34,704 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-10-14 22:07:34,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 22:07:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-10-14 22:07:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:07:34,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:34,706 INFO L380 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] [2019-10-14 22:07:34,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:34,920 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash 118595862, now seen corresponding path program 1 times [2019-10-14 22:07:34,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:34,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306324443] [2019-10-14 22:07:34,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:34,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:34,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:35,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306324443] [2019-10-14 22:07:35,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527900608] [2019-10-14 22:07:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:35,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-14 22:07:35,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:35,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:35,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:35,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:35,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,492 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 22:07:35,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:35,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:35,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:23 [2019-10-14 22:07:35,567 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 6=[|v_#memory_$Pointer$.base_35|]} [2019-10-14 22:07:35,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:35,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:35,625 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-10-14 22:07:35,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2019-10-14 22:07:35,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,662 INFO L567 ElimStorePlain]: treesize reduction 34, result has 52.8 percent of original size [2019-10-14 22:07:35,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:35,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:38 [2019-10-14 22:07:35,710 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_35|], 6=[|v_#memory_$Pointer$.base_36|]} [2019-10-14 22:07:35,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2019-10-14 22:07:35,715 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:35,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-10-14 22:07:35,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 121 [2019-10-14 22:07:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:35,808 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,854 INFO L567 ElimStorePlain]: treesize reduction 80, result has 38.9 percent of original size [2019-10-14 22:07:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:35,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:35,857 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:96, output treesize:51 [2019-10-14 22:07:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:35,961 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|], 6=[|v_#memory_int_36|]} [2019-10-14 22:07:35,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-10-14 22:07:35,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-10-14 22:07:35,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:35,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:35,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:35,995 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:24 [2019-10-14 22:07:36,067 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_31|], 6=[|v_#memory_int_37|]} [2019-10-14 22:07:36,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:36,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:36,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:36,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:36,133 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 22:07:36,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-10-14 22:07:36,134 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:36,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,155 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:27 [2019-10-14 22:07:36,230 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-10-14 22:07:36,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-10-14 22:07:36,234 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:36,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:36,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-10-14 22:07:36,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:36,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:36,257 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:36,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:36,262 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2019-10-14 22:07:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:36,270 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:36,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-10-14 22:07:36,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213516491] [2019-10-14 22:07:36,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 22:07:36,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:36,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 22:07:36,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:36,272 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 21 states. [2019-10-14 22:07:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:37,165 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2019-10-14 22:07:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 22:07:37,166 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-10-14 22:07:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:37,168 INFO L225 Difference]: With dead ends: 131 [2019-10-14 22:07:37,168 INFO L226 Difference]: Without dead ends: 129 [2019-10-14 22:07:37,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2019-10-14 22:07:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-14 22:07:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2019-10-14 22:07:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 22:07:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2019-10-14 22:07:37,178 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 27 [2019-10-14 22:07:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:37,179 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2019-10-14 22:07:37,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 22:07:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2019-10-14 22:07:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 22:07:37,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:37,180 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:37,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:37,387 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:37,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1811002181, now seen corresponding path program 2 times [2019-10-14 22:07:37,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:37,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652385361] [2019-10-14 22:07:37,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:37,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:37,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652385361] [2019-10-14 22:07:37,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66559441] [2019-10-14 22:07:37,694 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:37,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:37,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:37,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-14 22:07:37,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:37,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-10-14 22:07:37,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:37,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:23 [2019-10-14 22:07:37,979 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_32|], 2=[|v_#memory_int_39|, |v_#memory_$Pointer$.base_40|]} [2019-10-14 22:07:37,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2019-10-14 22:07:37,982 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:37,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 68 [2019-10-14 22:07:38,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,063 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.8 percent of original size [2019-10-14 22:07:38,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 90 [2019-10-14 22:07:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,122 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-10-14 22:07:38,185 INFO L567 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2019-10-14 22:07:38,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:38,192 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2019-10-14 22:07:38,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:38,347 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_41|], 15=[|v_#memory_int_40|]} [2019-10-14 22:07:38,352 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:38,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2019-10-14 22:07:38,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:07:38,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-10-14 22:07:38,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-10-14 22:07:38,364 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-10-14 22:07:38,422 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-10-14 22:07:38,430 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,467 INFO L341 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size [2019-10-14 22:07:38,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 54 [2019-10-14 22:07:38,468 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,504 INFO L567 ElimStorePlain]: treesize reduction 52, result has 39.5 percent of original size [2019-10-14 22:07:38,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 22:07:38,505 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:143, output treesize:34 [2019-10-14 22:07:38,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:38,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-10-14 22:07:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 22:07:38,632 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:38,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-10-14 22:07:38,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007120684] [2019-10-14 22:07:38,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 22:07:38,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 22:07:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-10-14 22:07:38,634 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 24 states. [2019-10-14 22:07:39,889 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-10-14 22:07:40,118 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-14 22:07:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:40,943 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2019-10-14 22:07:40,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 22:07:40,943 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-10-14 22:07:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:40,944 INFO L225 Difference]: With dead ends: 109 [2019-10-14 22:07:40,944 INFO L226 Difference]: Without dead ends: 98 [2019-10-14 22:07:40,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2019-10-14 22:07:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-14 22:07:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-10-14 22:07:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 22:07:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-10-14 22:07:40,954 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 28 [2019-10-14 22:07:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:40,954 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-10-14 22:07:40,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 22:07:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-10-14 22:07:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 22:07:40,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:40,956 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:41,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:41,160 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1416587397, now seen corresponding path program 3 times [2019-10-14 22:07:41,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:41,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501252136] [2019-10-14 22:07:41,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:41,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501252136] [2019-10-14 22:07:41,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718559381] [2019-10-14 22:07:41,913 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:42,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:07:42,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:42,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 89 conjunts are in the unsatisfiable core [2019-10-14 22:07:42,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:42,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:42,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:42,185 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:42,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,249 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-10-14 22:07:42,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:42,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:42,288 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,305 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:49 [2019-10-14 22:07:42,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:42,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,433 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 10=[|v_#memory_$Pointer$.offset_34|, |v_#memory_$Pointer$.base_43|]} [2019-10-14 22:07:42,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:42,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 32 [2019-10-14 22:07:42,488 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 83 [2019-10-14 22:07:42,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:42,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:42,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:42,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:42,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:42,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:42,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,669 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2019-10-14 22:07:42,670 INFO L567 ElimStorePlain]: treesize reduction 219, result has 23.4 percent of original size [2019-10-14 22:07:42,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,671 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:171, output treesize:95 [2019-10-14 22:07:42,776 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_42|], 11=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_44|]} [2019-10-14 22:07:42,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 22:07:42,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,872 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.6 percent of original size [2019-10-14 22:07:42,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-10-14 22:07:42,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:42,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:42,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:42,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 80 [2019-10-14 22:07:42,947 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,014 INFO L567 ElimStorePlain]: treesize reduction 96, result has 53.8 percent of original size [2019-10-14 22:07:43,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,015 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:166, output treesize:112 [2019-10-14 22:07:43,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,088 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_43|], 11=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_36|]} [2019-10-14 22:07:43,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-10-14 22:07:43,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,182 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-10-14 22:07:43,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 143 [2019-10-14 22:07:43,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,284 INFO L567 ElimStorePlain]: treesize reduction 96, result has 59.3 percent of original size [2019-10-14 22:07:43,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 112 [2019-10-14 22:07:43,302 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,323 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:203, output treesize:95 [2019-10-14 22:07:43,463 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_44|], 6=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_37|]} [2019-10-14 22:07:43,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2019-10-14 22:07:43,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,611 INFO L341 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-10-14 22:07:43,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 114 [2019-10-14 22:07:43,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:43,625 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,707 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.2 percent of original size [2019-10-14 22:07:43,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-10-14 22:07:43,716 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,747 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:141, output treesize:62 [2019-10-14 22:07:43,809 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_38|], 3=[|v_#memory_int_45|]} [2019-10-14 22:07:43,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2019-10-14 22:07:43,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,872 INFO L567 ElimStorePlain]: treesize reduction 8, result has 88.6 percent of original size [2019-10-14 22:07:43,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-14 22:07:43,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-10-14 22:07:43,915 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,935 INFO L567 ElimStorePlain]: treesize reduction 48, result has 37.7 percent of original size [2019-10-14 22:07:43,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,936 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:88, output treesize:29 [2019-10-14 22:07:44,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-10-14 22:07:44,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,032 INFO L567 ElimStorePlain]: treesize reduction 40, result has 42.0 percent of original size [2019-10-14 22:07:44,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:44,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-10-14 22:07:44,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-10-14 22:07:44,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-10-14 22:07:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:44,128 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:44,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2019-10-14 22:07:44,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544616086] [2019-10-14 22:07:44,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 22:07:44,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 22:07:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-10-14 22:07:44,130 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 25 states. [2019-10-14 22:07:44,641 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-14 22:07:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:47,103 INFO L93 Difference]: Finished difference Result 173 states and 212 transitions. [2019-10-14 22:07:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-14 22:07:47,104 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-10-14 22:07:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:47,105 INFO L225 Difference]: With dead ends: 173 [2019-10-14 22:07:47,105 INFO L226 Difference]: Without dead ends: 163 [2019-10-14 22:07:47,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 22:07:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-14 22:07:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2019-10-14 22:07:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-14 22:07:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2019-10-14 22:07:47,118 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 30 [2019-10-14 22:07:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:47,118 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2019-10-14 22:07:47,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 22:07:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2019-10-14 22:07:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 22:07:47,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:47,119 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:47,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:47,325 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 630287441, now seen corresponding path program 4 times [2019-10-14 22:07:47,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:47,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56108368] [2019-10-14 22:07:47,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,907 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-10-14 22:07:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:48,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56108368] [2019-10-14 22:07:48,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538001092] [2019-10-14 22:07:48,102 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:48,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 22:07:48,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:48,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-14 22:07:48,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:48,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:48,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:48,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:48,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,401 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-10-14 22:07:48,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:48,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:48,448 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,469 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:49 [2019-10-14 22:07:48,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:48,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 137 [2019-10-14 22:07:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:48,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,751 INFO L567 ElimStorePlain]: treesize reduction 165, result has 41.9 percent of original size [2019-10-14 22:07:48,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 102 [2019-10-14 22:07:48,785 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,821 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.8 percent of original size [2019-10-14 22:07:48,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,823 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:184, output treesize:80 [2019-10-14 22:07:48,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,926 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 77 [2019-10-14 22:07:48,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,987 INFO L567 ElimStorePlain]: treesize reduction 96, result has 52.2 percent of original size [2019-10-14 22:07:48,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-10-14 22:07:49,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2019-10-14 22:07:49,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 127 [2019-10-14 22:07:49,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,097 INFO L567 ElimStorePlain]: treesize reduction 72, result has 62.3 percent of original size [2019-10-14 22:07:49,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 99 [2019-10-14 22:07:49,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:80 [2019-10-14 22:07:49,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-10-14 22:07:49,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,282 INFO L341 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-10-14 22:07:49,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 104 [2019-10-14 22:07:49,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,296 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:49,350 INFO L567 ElimStorePlain]: treesize reduction 44, result has 56.9 percent of original size [2019-10-14 22:07:49,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:41 [2019-10-14 22:07:49,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-10-14 22:07:49,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2019-10-14 22:07:49,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,455 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-10-14 22:07:49,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:18 [2019-10-14 22:07:49,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:49,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:49,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 22:07:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:49,534 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:49,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-10-14 22:07:49,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047801195] [2019-10-14 22:07:49,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 22:07:49,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:49,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 22:07:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:07:49,536 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand 21 states. [2019-10-14 22:07:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:51,270 INFO L93 Difference]: Finished difference Result 178 states and 221 transitions. [2019-10-14 22:07:51,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 22:07:51,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-10-14 22:07:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:51,272 INFO L225 Difference]: With dead ends: 178 [2019-10-14 22:07:51,272 INFO L226 Difference]: Without dead ends: 144 [2019-10-14 22:07:51,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2019-10-14 22:07:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-14 22:07:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2019-10-14 22:07:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-14 22:07:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2019-10-14 22:07:51,287 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 31 [2019-10-14 22:07:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:51,287 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2019-10-14 22:07:51,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 22:07:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2019-10-14 22:07:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:51,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:51,288 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 22:07:51,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:51,489 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 722984259, now seen corresponding path program 1 times [2019-10-14 22:07:51,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:51,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614640768] [2019-10-14 22:07:51,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:51,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614640768] [2019-10-14 22:07:51,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459132589] [2019-10-14 22:07:51,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:51,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-14 22:07:51,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:51,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:51,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 22:07:51,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:51,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,827 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 22:07:51,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:51,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:51,834 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-10-14 22:07:51,888 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_56|]} [2019-10-14 22:07:51,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:51,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:51,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 64 [2019-10-14 22:07:51,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:51,975 INFO L567 ElimStorePlain]: treesize reduction 36, result has 41.9 percent of original size [2019-10-14 22:07:51,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:51,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:26 [2019-10-14 22:07:52,014 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_47|], 6=[|v_#memory_$Pointer$.base_57|]} [2019-10-14 22:07:52,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:52,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2019-10-14 22:07:52,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,093 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-10-14 22:07:52,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:39 [2019-10-14 22:07:52,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-10-14 22:07:52,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:52,215 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:52,232 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-10-14 22:07:52,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-14 22:07:52,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-10-14 22:07:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:52,247 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:52,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2019-10-14 22:07:52,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487801870] [2019-10-14 22:07:52,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:07:52,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:07:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:52,248 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 18 states. [2019-10-14 22:07:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:53,527 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2019-10-14 22:07:53,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 22:07:53,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-14 22:07:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:53,529 INFO L225 Difference]: With dead ends: 201 [2019-10-14 22:07:53,530 INFO L226 Difference]: Without dead ends: 187 [2019-10-14 22:07:53,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1514, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 22:07:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-14 22:07:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 138. [2019-10-14 22:07:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-14 22:07:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2019-10-14 22:07:53,545 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 32 [2019-10-14 22:07:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:53,545 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2019-10-14 22:07:53,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2019-10-14 22:07:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:53,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:53,547 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 22:07:53,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:53,751 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 780242561, now seen corresponding path program 1 times [2019-10-14 22:07:53,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:53,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475918763] [2019-10-14 22:07:53,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 22:07:53,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475918763] [2019-10-14 22:07:53,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:53,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:53,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547250287] [2019-10-14 22:07:53,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:53,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:53,831 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand 7 states. [2019-10-14 22:07:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:53,965 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2019-10-14 22:07:53,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:53,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-14 22:07:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:53,967 INFO L225 Difference]: With dead ends: 169 [2019-10-14 22:07:53,967 INFO L226 Difference]: Without dead ends: 147 [2019-10-14 22:07:53,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-14 22:07:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2019-10-14 22:07:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-14 22:07:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2019-10-14 22:07:53,981 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 32 [2019-10-14 22:07:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:53,983 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2019-10-14 22:07:53,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2019-10-14 22:07:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:53,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:53,985 INFO L380 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] [2019-10-14 22:07:53,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash 387215551, now seen corresponding path program 1 times [2019-10-14 22:07:53,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:53,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885169717] [2019-10-14 22:07:53,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:53,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:07:54,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885169717] [2019-10-14 22:07:54,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210541808] [2019-10-14 22:07:54,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:54,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-14 22:07:54,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:54,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:54,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 22:07:54,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:54,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-14 22:07:54,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:54,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,443 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_58|], 2=[|v_#memory_int_50|, |v_#memory_int_48|, |v_#memory_int_47|]} [2019-10-14 22:07:54,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:54,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:07:54,485 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,507 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-10-14 22:07:54,526 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,541 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:104, output treesize:45 [2019-10-14 22:07:54,600 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_59|], 4=[|v_#memory_int_51|]} [2019-10-14 22:07:54,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-10-14 22:07:54,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,643 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-10-14 22:07:54,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-10-14 22:07:54,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:24 [2019-10-14 22:07:54,683 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_60|], 6=[|v_#memory_int_52|]} [2019-10-14 22:07:54,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:54,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 22:07:54,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,741 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-14 22:07:54,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-10-14 22:07:54,742 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,759 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:27 [2019-10-14 22:07:54,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:54,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:54,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-14 22:07:54,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:54,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:07:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:54,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:54,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2019-10-14 22:07:54,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620934086] [2019-10-14 22:07:54,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:54,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-10-14 22:07:54,912 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand 19 states. [2019-10-14 22:07:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:55,845 INFO L93 Difference]: Finished difference Result 174 states and 207 transitions. [2019-10-14 22:07:55,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 22:07:55,846 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-10-14 22:07:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:55,847 INFO L225 Difference]: With dead ends: 174 [2019-10-14 22:07:55,847 INFO L226 Difference]: Without dead ends: 138 [2019-10-14 22:07:55,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-10-14 22:07:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-14 22:07:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2019-10-14 22:07:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-14 22:07:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2019-10-14 22:07:55,863 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 155 transitions. Word has length 32 [2019-10-14 22:07:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:55,863 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 155 transitions. [2019-10-14 22:07:55,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:07:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2019-10-14 22:07:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:55,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:55,864 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 22:07:56,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:56,071 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1945173470, now seen corresponding path program 1 times [2019-10-14 22:07:56,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:56,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672796721] [2019-10-14 22:07:56,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 22:07:56,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672796721] [2019-10-14 22:07:56,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:56,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:56,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009375007] [2019-10-14 22:07:56,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:56,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:56,158 INFO L87 Difference]: Start difference. First operand 129 states and 155 transitions. Second operand 6 states. [2019-10-14 22:07:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:56,285 INFO L93 Difference]: Finished difference Result 172 states and 204 transitions. [2019-10-14 22:07:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:07:56,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-14 22:07:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:56,287 INFO L225 Difference]: With dead ends: 172 [2019-10-14 22:07:56,287 INFO L226 Difference]: Without dead ends: 155 [2019-10-14 22:07:56,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-14 22:07:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2019-10-14 22:07:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-14 22:07:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2019-10-14 22:07:56,301 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 32 [2019-10-14 22:07:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:56,301 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2019-10-14 22:07:56,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2019-10-14 22:07:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:56,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:56,302 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 22:07:56,302 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1265115100, now seen corresponding path program 1 times [2019-10-14 22:07:56,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:56,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330488614] [2019-10-14 22:07:56,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:07:56,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330488614] [2019-10-14 22:07:56,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531076145] [2019-10-14 22:07:56,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 22:07:56,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:56,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:56,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:56,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 22:07:56,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2019-10-14 22:07:56,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2019-10-14 22:07:56,630 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:56,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:56,645 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:38 [2019-10-14 22:07:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:07:56,760 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:56,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-10-14 22:07:56,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25222985] [2019-10-14 22:07:56,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 22:07:56,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 22:07:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:07:56,761 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand 12 states. [2019-10-14 22:07:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:57,325 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2019-10-14 22:07:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:07:57,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-10-14 22:07:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:57,327 INFO L225 Difference]: With dead ends: 163 [2019-10-14 22:07:57,327 INFO L226 Difference]: Without dead ends: 140 [2019-10-14 22:07:57,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-14 22:07:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-10-14 22:07:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-14 22:07:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2019-10-14 22:07:57,338 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 32 [2019-10-14 22:07:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:57,339 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2019-10-14 22:07:57,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 22:07:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2019-10-14 22:07:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:57,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:57,340 INFO L380 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] [2019-10-14 22:07:57,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,544 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1338676576, now seen corresponding path program 1 times [2019-10-14 22:07:57,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:57,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877902297] [2019-10-14 22:07:57,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:57,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877902297] [2019-10-14 22:07:57,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942549086] [2019-10-14 22:07:57,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-14 22:07:57,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:57,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:07:57,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:07:57,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:57,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,852 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-10-14 22:07:57,865 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 22:07:57,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:07:57,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:57,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:57,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:57,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:42 [2019-10-14 22:07:58,031 INFO L341 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2019-10-14 22:07:58,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 69 [2019-10-14 22:07:58,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,071 INFO L567 ElimStorePlain]: treesize reduction 22, result has 63.9 percent of original size [2019-10-14 22:07:58,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:26 [2019-10-14 22:07:58,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:58,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,219 INFO L341 Elim1Store]: treesize reduction 75, result has 45.7 percent of original size [2019-10-14 22:07:58,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 78 [2019-10-14 22:07:58,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:58,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,291 INFO L567 ElimStorePlain]: treesize reduction 91, result has 34.5 percent of original size [2019-10-14 22:07:58,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:58,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:47 [2019-10-14 22:07:58,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 65 [2019-10-14 22:07:58,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:58,376 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:58,406 INFO L567 ElimStorePlain]: treesize reduction 36, result has 32.1 percent of original size [2019-10-14 22:07:58,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:9 [2019-10-14 22:07:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:58,435 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:58,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-10-14 22:07:58,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861338700] [2019-10-14 22:07:58,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:07:58,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:07:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:07:58,437 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand 17 states. [2019-10-14 22:07:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:59,434 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2019-10-14 22:07:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:07:59,436 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-10-14 22:07:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:59,437 INFO L225 Difference]: With dead ends: 186 [2019-10-14 22:07:59,437 INFO L226 Difference]: Without dead ends: 172 [2019-10-14 22:07:59,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:07:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-14 22:07:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-10-14 22:07:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-14 22:07:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2019-10-14 22:07:59,449 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 32 [2019-10-14 22:07:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:59,450 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2019-10-14 22:07:59,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:07:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2019-10-14 22:07:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:59,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:59,451 INFO L380 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] [2019-10-14 22:07:59,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:59,655 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2018734946, now seen corresponding path program 1 times [2019-10-14 22:07:59,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:59,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736061166] [2019-10-14 22:07:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 22:07:59,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736061166] [2019-10-14 22:07:59,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:59,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 22:07:59,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744480199] [2019-10-14 22:07:59,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 22:07:59,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:59,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 22:07:59,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 22:07:59,709 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 6 states. [2019-10-14 22:07:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:59,835 INFO L93 Difference]: Finished difference Result 217 states and 253 transitions. [2019-10-14 22:07:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 22:07:59,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-14 22:07:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:59,837 INFO L225 Difference]: With dead ends: 217 [2019-10-14 22:07:59,837 INFO L226 Difference]: Without dead ends: 151 [2019-10-14 22:07:59,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-14 22:07:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2019-10-14 22:07:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-14 22:07:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2019-10-14 22:07:59,850 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 32 [2019-10-14 22:07:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:59,850 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2019-10-14 22:07:59,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 22:07:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2019-10-14 22:07:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 22:07:59,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:59,851 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:59,851 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1093981088, now seen corresponding path program 5 times [2019-10-14 22:07:59,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:59,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523818031] [2019-10-14 22:07:59,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:59,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:59,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:00,161 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-10-14 22:08:00,367 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 30 [2019-10-14 22:08:00,757 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-10-14 22:08:01,248 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 40 [2019-10-14 22:08:01,688 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 [2019-10-14 22:08:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:02,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523818031] [2019-10-14 22:08:02,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693131587] [2019-10-14 22:08:02,073 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:02,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-14 22:08:02,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:02,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-14 22:08:02,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:02,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:02,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:08:02,387 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:02,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,468 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-10-14 22:08:02,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:02,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:08:02,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:02,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:08:02,503 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,521 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:99, output treesize:49 [2019-10-14 22:08:02,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:02,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,769 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-14 22:08:02,770 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.8 percent of original size [2019-10-14 22:08:02,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:02,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 146 [2019-10-14 22:08:02,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:02,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,980 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-10-14 22:08:02,981 INFO L567 ElimStorePlain]: treesize reduction 315, result has 31.5 percent of original size [2019-10-14 22:08:02,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:03,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 111 [2019-10-14 22:08:03,010 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,066 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.7 percent of original size [2019-10-14 22:08:03,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,067 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:201, output treesize:81 [2019-10-14 22:08:03,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:03,153 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 22:08:03,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,322 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-14 22:08:03,322 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-10-14 22:08:03,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 222 treesize of output 177 [2019-10-14 22:08:03,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:03,477 INFO L496 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:03,935 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 70 [2019-10-14 22:08:03,936 INFO L567 ElimStorePlain]: treesize reduction 474, result has 27.1 percent of original size [2019-10-14 22:08:04,381 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-10-14 22:08:04,382 INFO L341 Elim1Store]: treesize reduction 140, result has 69.8 percent of original size [2019-10-14 22:08:04,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 158 treesize of output 430 [2019-10-14 22:08:04,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:04,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:04,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms