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/dll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:07:56,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:07:56,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:07:56,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:07:56,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:07:56,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:07:56,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:07:56,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:07:56,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:07:56,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:07:56,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:07:56,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:07:56,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:07:56,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:07:56,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:07:56,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:07:56,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:07:56,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:07:56,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:07:56,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:07:56,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:07:56,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:07:56,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:07:56,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:07:56,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:07:56,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:07:56,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:07:56,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:07:56,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:07:56,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:07:56,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:07:56,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:07:56,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:07:56,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:07:56,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:07:56,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:07:56,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:07:56,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:07:56,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:07:56,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:07:56,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:07:56,573 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-13 18:07:56,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:07:56,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:07:56,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:07:56,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:07:56,589 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:07:56,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:07:56,590 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:07:56,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:07:56,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:07:56,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:07:56,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:07:56,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:07:56,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:07:56,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:07:56,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:07:56,593 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:07:56,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:07:56,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:07:56,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:07:56,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:07:56,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:07:56,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:07:56,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:07:56,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:07:56,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:07:56,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:07:56,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:07:56,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:07:56,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:07:56,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:07:56,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:07:56,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:07:56,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:07:56,947 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:07:56,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-13 18:07:57,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d596646f1/75ec7f1991e7497fbeb1735b2fdc3467/FLAG5366c62df [2019-10-13 18:07:57,521 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:07:57,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-13 18:07:57,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d596646f1/75ec7f1991e7497fbeb1735b2fdc3467/FLAG5366c62df [2019-10-13 18:07:57,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d596646f1/75ec7f1991e7497fbeb1735b2fdc3467 [2019-10-13 18:07:57,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:07:57,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:07:57,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:07:57,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:07:57,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:07:57,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:07:57" (1/1) ... [2019-10-13 18:07:57,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592a4aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:57, skipping insertion in model container [2019-10-13 18:07:57,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:07:57" (1/1) ... [2019-10-13 18:07:57,890 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:07:57,938 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:07:58,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:07:58,358 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:07:58,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:07:58,514 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:07:58,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58 WrapperNode [2019-10-13 18:07:58,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:07:58,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:07:58,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:07:58,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:07:58,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... [2019-10-13 18:07:58,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:07:58,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:07:58,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:07:58,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:07:58,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:07:58,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:07:58,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:07:58,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:07:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:07:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:07:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:07:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:07:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:07:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:07:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:07:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:07:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:07:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:07:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:07:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:07:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:07:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:07:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:07:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:07:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:07:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:07:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:07:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:07:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:07:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:07:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:07:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:07:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:07:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:07:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:07:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:07:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:07:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:07:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:07:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:07:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:07:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:07:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:07:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:07:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:07:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:07:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:07:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:07:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:07:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:07:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:07:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:07:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:07:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:07:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:07:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:07:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:07:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:07:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:07:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:07:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:07:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:07:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:07:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:07:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:07:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:07:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:07:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:07:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:07:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:07:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:07:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:07:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:07:59,364 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:07:59,364 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-13 18:07:59,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:07:59 BoogieIcfgContainer [2019-10-13 18:07:59,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:07:59,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:07:59,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:07:59,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:07:59,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:07:57" (1/3) ... [2019-10-13 18:07:59,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12783575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:07:59, skipping insertion in model container [2019-10-13 18:07:59,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:07:58" (2/3) ... [2019-10-13 18:07:59,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12783575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:07:59, skipping insertion in model container [2019-10-13 18:07:59,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:07:59" (3/3) ... [2019-10-13 18:07:59,374 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-13 18:07:59,383 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:07:59,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-13 18:07:59,402 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-13 18:07:59,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:07:59,427 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:07:59,427 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:07:59,427 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:07:59,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:07:59,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:07:59,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:07:59,428 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:07:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-10-13 18:07:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 18:07:59,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:07:59,454 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:07:59,456 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:07:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:07:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2019-10-13 18:07:59,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:07:59,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866614842] [2019-10-13 18:07:59,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:59,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:07:59,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:07:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:07:59,698 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-13 18:07:59,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866614842] [2019-10-13 18:07:59,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:07:59,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:07:59,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068724890] [2019-10-13 18:07:59,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:07:59,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:07:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:07:59,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:07:59,727 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-10-13 18:07:59,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:07:59,924 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-10-13 18:07:59,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:07:59,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 18:07:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:07:59,937 INFO L225 Difference]: With dead ends: 98 [2019-10-13 18:07:59,937 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 18:07:59,942 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-13 18:07:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 18:07:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-13 18:07:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 18:07:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-10-13 18:07:59,997 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2019-10-13 18:07:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:07:59,997 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-10-13 18:07:59,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:07:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-10-13 18:08:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 18:08:00,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:00,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:00,001 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2019-10-13 18:08:00,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:00,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848714665] [2019-10-13 18:08:00,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:00,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:00,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:00,173 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-13 18:08:00,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848714665] [2019-10-13 18:08:00,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:00,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:08:00,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101138615] [2019-10-13 18:08:00,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:08:00,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:08:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:08:00,179 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-10-13 18:08:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:00,389 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-10-13 18:08:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:08:00,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-13 18:08:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:00,393 INFO L225 Difference]: With dead ends: 51 [2019-10-13 18:08:00,393 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 18:08:00,395 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-13 18:08:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 18:08:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-13 18:08:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 18:08:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-13 18:08:00,408 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2019-10-13 18:08:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:00,409 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-13 18:08:00,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:08:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-13 18:08:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 18:08:00,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:00,412 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:00,412 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2019-10-13 18:08:00,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:00,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814069141] [2019-10-13 18:08:00,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:00,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:00,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:00,558 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-13 18:08:00,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814069141] [2019-10-13 18:08:00,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:00,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:08:00,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038792399] [2019-10-13 18:08:00,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:08:00,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:08:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:08:00,561 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2019-10-13 18:08:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:00,762 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-10-13 18:08:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:08:00,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-13 18:08:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:00,763 INFO L225 Difference]: With dead ends: 43 [2019-10-13 18:08:00,763 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 18:08:00,764 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-13 18:08:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 18:08:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-13 18:08:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 18:08:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-13 18:08:00,773 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2019-10-13 18:08:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:00,774 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-13 18:08:00,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:08:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-13 18:08:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 18:08:00,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:00,775 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:00,775 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2019-10-13 18:08:00,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:00,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212760324] [2019-10-13 18:08:00,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:00,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:00,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:00,996 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-13 18:08:00,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212760324] [2019-10-13 18:08:00,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:00,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:08:00,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972189900] [2019-10-13 18:08:00,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:08:00,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:08:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:00,999 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2019-10-13 18:08:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:01,429 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-10-13 18:08:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:08:01,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-13 18:08:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:01,431 INFO L225 Difference]: With dead ends: 82 [2019-10-13 18:08:01,431 INFO L226 Difference]: Without dead ends: 80 [2019-10-13 18:08:01,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-13 18:08:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-13 18:08:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2019-10-13 18:08:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 18:08:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-10-13 18:08:01,451 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 14 [2019-10-13 18:08:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:01,452 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-10-13 18:08:01,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:08:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-10-13 18:08:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 18:08:01,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:01,454 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:01,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2019-10-13 18:08:01,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:01,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85476091] [2019-10-13 18:08:01,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:01,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:01,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:01,573 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-13 18:08:01,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85476091] [2019-10-13 18:08:01,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:01,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:08:01,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492719608] [2019-10-13 18:08:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:08:01,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:08:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:08:01,577 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 5 states. [2019-10-13 18:08:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:01,754 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-13 18:08:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:08:01,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 18:08:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:01,755 INFO L225 Difference]: With dead ends: 59 [2019-10-13 18:08:01,755 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 18:08:01,756 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-13 18:08:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 18:08:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-13 18:08:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 18:08:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-10-13 18:08:01,768 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 15 [2019-10-13 18:08:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:01,770 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-10-13 18:08:01,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:08:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-10-13 18:08:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 18:08:01,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:01,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:01,772 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash 373775322, now seen corresponding path program 1 times [2019-10-13 18:08:01,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:01,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357993272] [2019-10-13 18:08:01,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:01,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:01,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:01,904 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-13 18:08:01,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357993272] [2019-10-13 18:08:01,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:01,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 18:08:01,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587417709] [2019-10-13 18:08:01,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 18:08:01,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 18:08:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:08:01,905 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2019-10-13 18:08:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:02,035 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-10-13 18:08:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:08:02,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 18:08:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:02,037 INFO L225 Difference]: With dead ends: 57 [2019-10-13 18:08:02,037 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 18:08:02,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-13 18:08:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 18:08:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-13 18:08:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 18:08:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-10-13 18:08:02,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 17 [2019-10-13 18:08:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:02,044 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-10-13 18:08:02,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 18:08:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-10-13 18:08:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 18:08:02,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:02,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:02,046 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2019-10-13 18:08:02,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:02,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427985724] [2019-10-13 18:08:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:02,127 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-13 18:08:02,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427985724] [2019-10-13 18:08:02,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:08:02,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:08:02,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433423582] [2019-10-13 18:08:02,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:08:02,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:08:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:08:02,130 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 6 states. [2019-10-13 18:08:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:02,321 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-10-13 18:08:02,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:08:02,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 18:08:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:02,323 INFO L225 Difference]: With dead ends: 70 [2019-10-13 18:08:02,323 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 18:08:02,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:08:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 18:08:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-13 18:08:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 18:08:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-13 18:08:02,332 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 18 [2019-10-13 18:08:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:02,332 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-13 18:08:02,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:08:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-13 18:08:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 18:08:02,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:02,333 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] [2019-10-13 18:08:02,334 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2019-10-13 18:08:02,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:02,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856314749] [2019-10-13 18:08:02,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:02,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:02,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:02,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856314749] [2019-10-13 18:08:02,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163778202] [2019-10-13 18:08:02,448 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-13 18:08:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:02,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 18:08:02,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:02,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-13 18:08:02,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:02,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:02,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-13 18:08:02,701 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:02,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:02,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:02,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-13 18:08:02,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:02,775 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-13 18:08:02,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:02,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:02,790 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-13 18:08:02,791 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-13 18:08:02,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:02,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:02,797 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-13 18:08:02,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-13 18:08:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:02,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:02,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-13 18:08:02,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574913641] [2019-10-13 18:08:02,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:08:02,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:08:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:08:02,822 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2019-10-13 18:08:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:03,237 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-10-13 18:08:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:08:03,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-13 18:08:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:03,238 INFO L225 Difference]: With dead ends: 79 [2019-10-13 18:08:03,238 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 18:08:03,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-13 18:08:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 18:08:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-13 18:08:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 18:08:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-10-13 18:08:03,249 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 21 [2019-10-13 18:08:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:03,249 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-10-13 18:08:03,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:08:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-10-13 18:08:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 18:08:03,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:03,250 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-13 18:08:03,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:03,462 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1056872398, now seen corresponding path program 1 times [2019-10-13 18:08:03,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:03,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614900515] [2019-10-13 18:08:03,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:03,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:03,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:03,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614900515] [2019-10-13 18:08:03,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430123136] [2019-10-13 18:08:03,788 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-13 18:08:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:03,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 18:08:03,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:03,935 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 18:08:03,936 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 18:08:03,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:03,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:03,952 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-13 18:08:03,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:03,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:03,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:03,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-10-13 18:08:04,049 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,049 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-13 18:08:04,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,140 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-10-13 18:08:04,155 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-13 18:08:04,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,213 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-13 18:08:04,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:04,277 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:04,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,335 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 1 case distinctions, treesize of input 77 treesize of output 55 [2019-10-13 18:08:04,336 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,385 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-10-13 18:08:04,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,388 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-10-13 18:08:04,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,438 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 16 treesize of output 26 [2019-10-13 18:08:04,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,491 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_39|, |v_#memory_int_40|, |v_#memory_$Pointer$.base_30|, |v_#memory_int_41|], 4=[|v_#memory_int_43|]} [2019-10-13 18:08:04,498 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-13 18:08:04,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,535 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-13 18:08:04,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:04,569 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,593 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:04,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:04,676 INFO L341 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-10-13 18:08:04,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2019-10-13 18:08:04,677 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,738 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-10-13 18:08:04,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:04,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:04,747 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-10-13 18:08:04,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 13 [2019-10-13 18:08:04,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:04,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:04,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-10-13 18:08:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:04,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:04,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-13 18:08:04,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937253110] [2019-10-13 18:08:04,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 18:08:04,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 18:08:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:08:04,872 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2019-10-13 18:08:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:05,622 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-13 18:08:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 18:08:05,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-10-13 18:08:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:05,624 INFO L225 Difference]: With dead ends: 89 [2019-10-13 18:08:05,624 INFO L226 Difference]: Without dead ends: 87 [2019-10-13 18:08:05,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-10-13 18:08:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-13 18:08:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2019-10-13 18:08:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 18:08:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-13 18:08:05,632 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2019-10-13 18:08:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:05,633 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-13 18:08:05,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 18:08:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-13 18:08:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 18:08:05,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:05,634 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-13 18:08:05,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:05,839 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash -377613816, now seen corresponding path program 1 times [2019-10-13 18:08:05,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:05,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489998416] [2019-10-13 18:08:05,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:05,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:05,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:06,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489998416] [2019-10-13 18:08:06,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359047377] [2019-10-13 18:08:06,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:06,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-13 18:08:06,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:06,261 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 18:08:06,261 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 18:08:06,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:06,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:06,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:06,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-13 18:08:06,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:06,351 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-13 18:08:06,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:06,464 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-13 18:08:06,464 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-13 18:08:06,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:06,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:06,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:06,501 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 63 treesize of output 41 [2019-10-13 18:08:06,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:06,578 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-13 18:08:06,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:06,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:06,598 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 63 treesize of output 41 [2019-10-13 18:08:06,599 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:06,675 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-13 18:08:06,676 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-13 18:08:06,676 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-13 18:08:06,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:06,795 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-13 18:08:06,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:07,052 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-13 18:08:07,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:07,054 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|], 11=[|v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.base_32|]} [2019-10-13 18:08:07,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:07,068 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 3 case distinctions, treesize of input 433 treesize of output 289 [2019-10-13 18:08:07,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:07,360 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-13 18:08:07,360 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2019-10-13 18:08:07,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-13 18:08:07,413 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:07,537 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-13 18:08:07,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:07,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:07,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:07,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:07,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:07,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:07,610 INFO L341 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-10-13 18:08:07,611 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 1 case distinctions, treesize of input 135 treesize of output 97 [2019-10-13 18:08:07,612 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:07,746 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-13 18:08:07,747 INFO L567 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2019-10-13 18:08:07,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:07,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:07,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:07,821 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 7 case distinctions, treesize of input 174 treesize of output 144 [2019-10-13 18:08:07,823 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:07,956 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-13 18:08:07,957 INFO L567 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2019-10-13 18:08:07,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:07,959 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2019-10-13 18:08:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:08,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:08,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:08,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2019-10-13 18:08:08,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:08,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:08,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:08,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:138, output treesize:75 [2019-10-13 18:08:08,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:08,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 86 [2019-10-13 18:08:08,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:08,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:08,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:08,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:08,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:08,403 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-13 18:08:08,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:4 [2019-10-13 18:08:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:08,421 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:08,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-13 18:08:08,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259062612] [2019-10-13 18:08:08,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 18:08:08,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 18:08:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 18:08:08,423 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 18 states. [2019-10-13 18:08:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:10,055 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-10-13 18:08:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 18:08:10,055 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-13 18:08:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:10,057 INFO L225 Difference]: With dead ends: 109 [2019-10-13 18:08:10,057 INFO L226 Difference]: Without dead ends: 107 [2019-10-13 18:08:10,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2019-10-13 18:08:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-13 18:08:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-10-13 18:08:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 18:08:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-10-13 18:08:10,068 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 32 [2019-10-13 18:08:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:10,069 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-10-13 18:08:10,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 18:08:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-10-13 18:08:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 18:08:10,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:10,070 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-13 18:08:10,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:10,278 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash -243600310, now seen corresponding path program 1 times [2019-10-13 18:08:10,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:10,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50322414] [2019-10-13 18:08:10,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:10,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:10,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:10,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50322414] [2019-10-13 18:08:10,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642216362] [2019-10-13 18:08:10,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 18:08:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:10,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-13 18:08:10,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:10,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:10,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:10,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:10,992 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 63 treesize of output 41 [2019-10-13 18:08:10,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,055 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.2 percent of original size [2019-10-13 18:08:11,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:11,092 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 2 case distinctions, treesize of input 63 treesize of output 65 [2019-10-13 18:08:11,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,153 INFO L567 ElimStorePlain]: treesize reduction 40, result has 59.6 percent of original size [2019-10-13 18:08:11,154 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-13 18:08:11,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:56 [2019-10-13 18:08:11,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:11,224 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 12=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_34|]} [2019-10-13 18:08:11,234 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 103 treesize of output 99 [2019-10-13 18:08:11,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,242 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 99 treesize of output 95 [2019-10-13 18:08:11,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,427 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-10-13 18:08:11,428 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.5 percent of original size [2019-10-13 18:08:11,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,461 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 79 [2019-10-13 18:08:11,462 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:11,481 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 2 case distinctions, treesize of input 99 treesize of output 97 [2019-10-13 18:08:11,482 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,623 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-13 18:08:11,624 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.1 percent of original size [2019-10-13 18:08:11,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,656 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:11,657 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 2 case distinctions, treesize of input 80 treesize of output 78 [2019-10-13 18:08:11,658 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:11,682 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2019-10-13 18:08:11,683 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:11,824 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-13 18:08:11,824 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.6 percent of original size [2019-10-13 18:08:11,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 18:08:11,825 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:203, output treesize:116 [2019-10-13 18:08:11,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:12,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:12,185 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 1=[v_prenex_2, v_prenex_3]} [2019-10-13 18:08:12,191 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2019-10-13 18:08:12,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:12,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:12,229 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-10-13 18:08:12,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:12,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:12,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:12,268 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 59 [2019-10-13 18:08:12,269 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:12,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:12,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:12,309 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 2 case distinctions, treesize of input 47 treesize of output 39 [2019-10-13 18:08:12,310 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:12,365 INFO L567 ElimStorePlain]: treesize reduction 8, result has 83.3 percent of original size [2019-10-13 18:08:12,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-13 18:08:12,366 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:138, output treesize:32 [2019-10-13 18:08:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:12,427 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-13 18:08:12,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:12,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:12,430 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-13 18:08:12,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 18:08:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:12,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:12,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2019-10-13 18:08:12,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194953484] [2019-10-13 18:08:12,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 18:08:12,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 18:08:12,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-10-13 18:08:12,465 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 22 states. [2019-10-13 18:08:13,511 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-10-13 18:08:13,944 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-10-13 18:08:14,173 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-10-13 18:08:14,340 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2019-10-13 18:08:14,543 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-10-13 18:08:14,753 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-13 18:08:14,893 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-10-13 18:08:15,118 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-10-13 18:08:15,300 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-13 18:08:15,519 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-13 18:08:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:15,815 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-10-13 18:08:15,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 18:08:15,816 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 18:08:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:15,823 INFO L225 Difference]: With dead ends: 123 [2019-10-13 18:08:15,824 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 18:08:15,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 18:08:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 18:08:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2019-10-13 18:08:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 18:08:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2019-10-13 18:08:15,849 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 32 [2019-10-13 18:08:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:15,853 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2019-10-13 18:08:15,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 18:08:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2019-10-13 18:08:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 18:08:15,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:15,863 INFO L380 BasicCegarLoop]: trace histogram [3, 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-13 18:08:16,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:16,067 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 145286649, now seen corresponding path program 2 times [2019-10-13 18:08:16,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:16,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279632951] [2019-10-13 18:08:16,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:16,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279632951] [2019-10-13 18:08:16,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471451635] [2019-10-13 18:08:16,443 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 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-13 18:08:16,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:08:16,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:16,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-13 18:08:16,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:16,606 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 18:08:16,606 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 18:08:16,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:16,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-13 18:08:16,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,679 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-13 18:08:16,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,801 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-13 18:08:16,802 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-13 18:08:16,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:16,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:16,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,829 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 63 treesize of output 41 [2019-10-13 18:08:16,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,895 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-13 18:08:16,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:16,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:16,918 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 63 treesize of output 41 [2019-10-13 18:08:16,918 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:16,981 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-13 18:08:16,982 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-13 18:08:16,982 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-13 18:08:17,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,098 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-13 18:08:17,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,388 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-13 18:08:17,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,392 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|, |v_#memory_int_47|], 2=[|v_#memory_int_45|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_37|], 11=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|]} [2019-10-13 18:08:17,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-10-13 18:08:17,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:17,864 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-13 18:08:17,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:17,893 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 27 treesize of output 15 [2019-10-13 18:08:17,894 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,100 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-13 18:08:18,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,106 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-13 18:08:18,264 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-13 18:08:18,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:18,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:18,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 231 [2019-10-13 18:08:18,281 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,599 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-10-13 18:08:18,599 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-10-13 18:08:18,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:18,607 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 3 case distinctions, treesize of input 1143 treesize of output 691 [2019-10-13 18:08:18,609 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:18,937 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-10-13 18:08:18,937 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.9 percent of original size [2019-10-13 18:08:18,958 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 57 treesize of output 39 [2019-10-13 18:08:18,959 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:19,073 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-13 18:08:19,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:19,272 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-10-13 18:08:19,272 INFO L341 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-10-13 18:08:19,273 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 579 treesize of output 565 [2019-10-13 18:08:19,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:19,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:19,325 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 21 xjuncts. [2019-10-13 18:08:20,130 WARN L191 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 58 [2019-10-13 18:08:20,130 INFO L567 ElimStorePlain]: treesize reduction 28306, result has 1.4 percent of original size [2019-10-13 18:08:20,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:20,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:20,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:20,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 111 [2019-10-13 18:08:20,161 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:20,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:20,188 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:102 [2019-10-13 18:08:20,283 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-10-13 18:08:20,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 71 [2019-10-13 18:08:20,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:20,299 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-13 18:08:20,368 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-10-13 18:08:20,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:20,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-10-13 18:08:20,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:20,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,382 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-13 18:08:20,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-10-13 18:08:20,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:20,414 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-13 18:08:20,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:20,421 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-10-13 18:08:20,421 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-13 18:08:20,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-13 18:08:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:20,453 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:20,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-13 18:08:20,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304665430] [2019-10-13 18:08:20,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 18:08:20,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:20,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 18:08:20,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:08:20,455 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 15 states. [2019-10-13 18:08:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:21,656 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2019-10-13 18:08:21,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:08:21,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-10-13 18:08:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:21,658 INFO L225 Difference]: With dead ends: 131 [2019-10-13 18:08:21,658 INFO L226 Difference]: Without dead ends: 119 [2019-10-13 18:08:21,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-13 18:08:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-13 18:08:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2019-10-13 18:08:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-13 18:08:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-10-13 18:08:21,669 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 35 [2019-10-13 18:08:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:21,669 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-10-13 18:08:21,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 18:08:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-10-13 18:08:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 18:08:21,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:21,671 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, 1, 1, 1] [2019-10-13 18:08:21,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:21,876 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash -969799515, now seen corresponding path program 1 times [2019-10-13 18:08:21,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:21,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569753014] [2019-10-13 18:08:21,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:21,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:21,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:22,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569753014] [2019-10-13 18:08:22,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118910965] [2019-10-13 18:08:22,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 18:08:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:22,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-13 18:08:22,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:22,420 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 18:08:22,420 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 18:08:22,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:22,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-13 18:08:22,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,480 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-13 18:08:22,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,606 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-13 18:08:22,606 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-13 18:08:22,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:22,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:22,615 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:22,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,628 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 63 treesize of output 41 [2019-10-13 18:08:22,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,696 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-13 18:08:22,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:22,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:22,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,715 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 63 treesize of output 41 [2019-10-13 18:08:22,716 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:22,770 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-13 18:08:22,771 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-13 18:08:22,771 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-13 18:08:22,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:22,882 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-13 18:08:22,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:23,066 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-13 18:08:23,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,069 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|], 6=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|], 11=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_40|]} [2019-10-13 18:08:23,085 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 165 treesize of output 109 [2019-10-13 18:08:23,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:23,240 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-13 18:08:23,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,258 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 3 case distinctions, treesize of input 1033 treesize of output 625 [2019-10-13 18:08:23,260 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:23,456 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-13 18:08:23,456 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-10-13 18:08:23,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-13 18:08:23,476 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:23,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:23,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:23,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:23,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:23,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 613 treesize of output 434 [2019-10-13 18:08:23,560 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:23,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,643 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 7 case distinctions, treesize of input 129 treesize of output 134 [2019-10-13 18:08:23,644 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:23,741 INFO L567 ElimStorePlain]: treesize reduction 124, result has 42.3 percent of original size [2019-10-13 18:08:23,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:23,742 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:1110, output treesize:91 [2019-10-13 18:08:23,913 INFO L392 ElimStorePlain]: Different costs {10=[|#memory_$Pointer$.base|], 14=[|#memory_$Pointer$.offset|]} [2019-10-13 18:08:23,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:23,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 126 [2019-10-13 18:08:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:23,972 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:24,037 INFO L567 ElimStorePlain]: treesize reduction 61, result has 53.1 percent of original size [2019-10-13 18:08:24,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2019-10-13 18:08:24,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,071 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-13 18:08:24,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:163, output treesize:11 [2019-10-13 18:08:24,100 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-13 18:08:24,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:24,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:24,102 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-13 18:08:24,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 18:08:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:24,114 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:24,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-10-13 18:08:24,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808885739] [2019-10-13 18:08:24,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 18:08:24,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 18:08:24,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=233, Unknown=1, NotChecked=0, Total=272 [2019-10-13 18:08:24,116 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 17 states. [2019-10-13 18:08:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:25,923 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-10-13 18:08:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 18:08:25,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-10-13 18:08:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:25,925 INFO L225 Difference]: With dead ends: 126 [2019-10-13 18:08:25,926 INFO L226 Difference]: Without dead ends: 124 [2019-10-13 18:08:25,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=587, Unknown=1, NotChecked=0, Total=702 [2019-10-13 18:08:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-13 18:08:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2019-10-13 18:08:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 18:08:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-10-13 18:08:25,936 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 35 [2019-10-13 18:08:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:25,936 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-10-13 18:08:25,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 18:08:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-10-13 18:08:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 18:08:25,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:25,938 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2019-10-13 18:08:26,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:26,142 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash 4024618, now seen corresponding path program 2 times [2019-10-13 18:08:26,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:26,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554857864] [2019-10-13 18:08:26,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:26,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:26,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:08:26,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554857864] [2019-10-13 18:08:26,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161819920] [2019-10-13 18:08:26,419 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 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-13 18:08:26,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:08:26,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:08:26,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-13 18:08:26,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:26,591 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 18:08:26,591 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 18:08:26,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:26,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-13 18:08:26,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,659 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-13 18:08:26,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:26,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,723 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 63 treesize of output 41 [2019-10-13 18:08:26,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,784 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.7 percent of original size [2019-10-13 18:08:26,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,801 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,802 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 63 treesize of output 41 [2019-10-13 18:08:26,802 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,850 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.7 percent of original size [2019-10-13 18:08:26,851 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-13 18:08:26,851 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:197, output treesize:68 [2019-10-13 18:08:26,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,897 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 45 treesize of output 35 [2019-10-13 18:08:26,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:26,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:26,935 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 3 case distinctions, treesize of input 64 treesize of output 53 [2019-10-13 18:08:26,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,974 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-10-13 18:08:26,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:26,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:56 [2019-10-13 18:08:27,175 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-13 18:08:27,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 53 [2019-10-13 18:08:27,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:27,179 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-13 18:08:27,216 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.3 percent of original size [2019-10-13 18:08:27,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 32 [2019-10-13 18:08:27,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:27,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:27,244 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-13 18:08:27,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:10 [2019-10-13 18:08:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:08:27,284 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:27,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-10-13 18:08:27,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9874354] [2019-10-13 18:08:27,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 18:08:27,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 18:08:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-13 18:08:27,287 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 18 states. [2019-10-13 18:08:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:28,606 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-10-13 18:08:28,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:08:28,608 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-10-13 18:08:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:28,609 INFO L225 Difference]: With dead ends: 124 [2019-10-13 18:08:28,609 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 18:08:28,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-10-13 18:08:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 18:08:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-10-13 18:08:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-13 18:08:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-10-13 18:08:28,627 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 38 [2019-10-13 18:08:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:28,628 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-10-13 18:08:28,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 18:08:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-10-13 18:08:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 18:08:28,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:28,634 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:28,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:28,849 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -233815650, now seen corresponding path program 1 times [2019-10-13 18:08:28,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:28,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264460380] [2019-10-13 18:08:28,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:28,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:28,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:29,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264460380] [2019-10-13 18:08:29,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209713616] [2019-10-13 18:08:29,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 18:08:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:29,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-13 18:08:29,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:08:29,276 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 18:08:29,276 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-13 18:08:29,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:29,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:29,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-13 18:08:29,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,349 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-13 18:08:29,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:29,443 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-13 18:08:29,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:29,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:08:29,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,469 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 63 treesize of output 41 [2019-10-13 18:08:29,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:29,546 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-13 18:08:29,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:29,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,564 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 63 treesize of output 41 [2019-10-13 18:08:29,565 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:29,626 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-13 18:08:29,626 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-13 18:08:29,627 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2019-10-13 18:08:29,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,721 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-13 18:08:29,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:29,889 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-13 18:08:29,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,892 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|], 11=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-10-13 18:08:29,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:29,901 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 3 case distinctions, treesize of input 433 treesize of output 289 [2019-10-13 18:08:29,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,187 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-13 18:08:30,187 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2019-10-13 18:08:30,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-13 18:08:30,210 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,353 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-13 18:08:30,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:30,615 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-10-13 18:08:30,615 INFO L341 Elim1Store]: treesize reduction 250, result has 36.9 percent of original size [2019-10-13 18:08:30,616 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 327 treesize of output 281 [2019-10-13 18:08:30,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:30,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:30,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:30,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:30,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 18:08:30,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:30,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:30,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 18:08:30,632 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-13 18:08:30,838 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-13 18:08:30,838 INFO L567 ElimStorePlain]: treesize reduction 118, result has 59.2 percent of original size [2019-10-13 18:08:30,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:30,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:30,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:30,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:08:30,887 INFO L341 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-10-13 18:08:30,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, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2019-10-13 18:08:30,889 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,993 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-10-13 18:08:30,993 INFO L567 ElimStorePlain]: treesize reduction 41, result has 68.0 percent of original size [2019-10-13 18:08:30,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:08:30,994 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:121 [2019-10-13 18:08:31,622 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-13 18:08:31,622 INFO L341 Elim1Store]: treesize reduction 16, result has 87.5 percent of original size [2019-10-13 18:08:31,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 180 treesize of output 195 [2019-10-13 18:08:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:08:31,780 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:08:31,888 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-10-13 18:08:31,889 INFO L567 ElimStorePlain]: treesize reduction 137, result has 34.8 percent of original size [2019-10-13 18:08:31,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 57 [2019-10-13 18:08:31,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:08:31,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:08:31,932 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-13 18:08:31,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:190, output treesize:10 [2019-10-13 18:08:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:31,972 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:08:31,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-13 18:08:31,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143556708] [2019-10-13 18:08:31,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 18:08:31,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:08:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 18:08:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-13 18:08:31,975 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 22 states. [2019-10-13 18:08:32,796 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-13 18:08:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:08:34,319 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-10-13 18:08:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 18:08:34,320 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-10-13 18:08:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:08:34,321 INFO L225 Difference]: With dead ends: 124 [2019-10-13 18:08:34,321 INFO L226 Difference]: Without dead ends: 94 [2019-10-13 18:08:34,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2019-10-13 18:08:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-13 18:08:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-10-13 18:08:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-13 18:08:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-10-13 18:08:34,331 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 40 [2019-10-13 18:08:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:08:34,331 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-10-13 18:08:34,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 18:08:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-10-13 18:08:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 18:08:34,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:08:34,332 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:08:34,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:08:34,536 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:08:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:08:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -372709504, now seen corresponding path program 3 times [2019-10-13 18:08:34,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:08:34,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319934495] [2019-10-13 18:08:34,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:34,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:08:34,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:08:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:08:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:08:35,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319934495] [2019-10-13 18:08:35,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337448637] [2019-10-13 18:08:35,029 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 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