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-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:01:23,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:23,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:23,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:23,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:23,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:23,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:23,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:23,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:23,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:23,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:23,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:23,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:23,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:23,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:23,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:23,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:23,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:23,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:23,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:23,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:23,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:23,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:23,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:23,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:23,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:23,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:23,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:23,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:23,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:23,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:23,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:23,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:23,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:23,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:23,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:23,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:23,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:23,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:23,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:23,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:23,650 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-09-20 13:01:23,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:23,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:23,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:23,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:23,667 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:23,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:23,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:23,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:23,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:23,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:23,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:23,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:23,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:23,669 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:23,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:23,669 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:23,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:23,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:23,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:23,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:23,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:23,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:23,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:23,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:23,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:23,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:23,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:23,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:23,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:23,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:23,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:23,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:23,731 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:23,733 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:23,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-09-20 13:01:23,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68adeb30d/daef22e59b9049ed884ca71f8bd90635/FLAG7124d645c [2019-09-20 13:01:24,401 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:01:24,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-09-20 13:01:24,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68adeb30d/daef22e59b9049ed884ca71f8bd90635/FLAG7124d645c [2019-09-20 13:01:24,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68adeb30d/daef22e59b9049ed884ca71f8bd90635 [2019-09-20 13:01:24,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:01:24,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:01:24,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:24,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:01:24,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:01:24,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:24" (1/1) ... [2019-09-20 13:01:24,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63923cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:24, skipping insertion in model container [2019-09-20 13:01:24,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:24" (1/1) ... [2019-09-20 13:01:24,677 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:01:24,727 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:01:25,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:25,180 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:01:25,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:25,307 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:01:25,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25 WrapperNode [2019-09-20 13:01:25,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:25,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:01:25,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:01:25,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:01:25,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (1/1) ... [2019-09-20 13:01:25,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:01:25,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:01:25,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:01:25,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:01:25,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (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-09-20 13:01:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:01:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:01:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:01:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:01:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:01:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:01:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:01:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:01:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:01:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:01:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:01:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:01:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:01:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:01:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:01:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:01:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:01:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:01:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:01:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:01:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:01:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:01:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:01:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:01:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:01:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:01:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:01:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:01:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:01:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:01:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:01:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:01:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:01:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:01:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:01:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:01:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:01:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:01:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:01:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:01:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:01:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:01:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:01:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:01:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:01:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:01:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:01:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:01:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:01:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:01:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:01:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:01:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:01:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:01:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:01:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:01:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:01:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:01:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:01:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:01:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:01:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:01:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:01:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:01:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:01:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:01:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:01:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:01:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:01:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:01:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:01:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:01:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:01:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:01:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:01:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:01:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:01:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:01:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:01:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:01:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:01:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:01:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:01:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:01:26,187 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:01:26,188 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-20 13:01:26,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:26 BoogieIcfgContainer [2019-09-20 13:01:26,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:01:26,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:01:26,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:01:26,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:01:26,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:01:24" (1/3) ... [2019-09-20 13:01:26,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fb89ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:26, skipping insertion in model container [2019-09-20 13:01:26,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:25" (2/3) ... [2019-09-20 13:01:26,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fb89ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:26, skipping insertion in model container [2019-09-20 13:01:26,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:26" (3/3) ... [2019-09-20 13:01:26,201 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-09-20 13:01:26,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:01:26,223 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-20 13:01:26,241 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-20 13:01:26,280 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:01:26,280 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:01:26,280 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:01:26,281 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:01:26,281 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:01:26,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:01:26,282 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:01:26,282 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:01:26,282 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:01:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-09-20 13:01:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-20 13:01:26,309 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:26,310 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:26,312 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-09-20 13:01:26,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:26,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:26,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:26,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:26,519 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-09-20 13:01:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:26,607 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-09-20 13:01:26,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:26,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-20 13:01:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:26,620 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:01:26,621 INFO L226 Difference]: Without dead ends: 99 [2019-09-20 13:01:26,625 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-20 13:01:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-09-20 13:01:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-20 13:01:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-20 13:01:26,674 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-09-20 13:01:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:26,674 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-20 13:01:26,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-20 13:01:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:01:26,676 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:26,676 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:26,676 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-09-20 13:01:26,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:26,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:26,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:26,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:26,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:26,766 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-09-20 13:01:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:26,788 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-20 13:01:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:26,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-20 13:01:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:26,790 INFO L225 Difference]: With dead ends: 84 [2019-09-20 13:01:26,790 INFO L226 Difference]: Without dead ends: 82 [2019-09-20 13:01:26,792 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-20 13:01:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-20 13:01:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-20 13:01:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-20 13:01:26,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-09-20 13:01:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:26,808 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-20 13:01:26,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-20 13:01:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:01:26,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:26,809 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:26,810 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-09-20 13:01:26,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:26,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:26,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:26,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:26,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:01:26,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:01:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:01:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:26,940 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2019-09-20 13:01:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,034 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-09-20 13:01:27,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:27,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-20 13:01:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,036 INFO L225 Difference]: With dead ends: 84 [2019-09-20 13:01:27,036 INFO L226 Difference]: Without dead ends: 82 [2019-09-20 13:01:27,036 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-20 13:01:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-20 13:01:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-20 13:01:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-09-20 13:01:27,047 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-09-20 13:01:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,048 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-09-20 13:01:27,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:01:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-09-20 13:01:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:01:27,049 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,049 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,050 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,050 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-09-20 13:01:27,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:01:27,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:01:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:01:27,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:27,155 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2019-09-20 13:01:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,306 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-09-20 13:01:27,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:27,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-20 13:01:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,308 INFO L225 Difference]: With dead ends: 199 [2019-09-20 13:01:27,308 INFO L226 Difference]: Without dead ends: 132 [2019-09-20 13:01:27,309 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-20 13:01:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-09-20 13:01:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-20 13:01:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-09-20 13:01:27,318 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2019-09-20 13:01:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,318 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-09-20 13:01:27,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:01:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-09-20 13:01:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:01:27,319 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,319 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,320 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2019-09-20 13:01:27,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:27,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:27,395 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2019-09-20 13:01:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,543 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-09-20 13:01:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:01:27,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-20 13:01:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,546 INFO L225 Difference]: With dead ends: 126 [2019-09-20 13:01:27,546 INFO L226 Difference]: Without dead ends: 122 [2019-09-20 13:01:27,546 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-20 13:01:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-09-20 13:01:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 13:01:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-09-20 13:01:27,565 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2019-09-20 13:01:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,566 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-09-20 13:01:27,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-09-20 13:01:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:01:27,567 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,568 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,568 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2019-09-20 13:01:27,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:27,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:27,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:27,654 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-09-20 13:01:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,751 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-09-20 13:01:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:27,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-20 13:01:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,753 INFO L225 Difference]: With dead ends: 136 [2019-09-20 13:01:27,753 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:01:27,754 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:01:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2019-09-20 13:01:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-20 13:01:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-09-20 13:01:27,761 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2019-09-20 13:01:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,762 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-09-20 13:01:27,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-09-20 13:01:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:01:27,763 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,763 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,764 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2019-09-20 13:01:27,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:27,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:27,806 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2019-09-20 13:01:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,822 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-09-20 13:01:27,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:27,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:01:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,824 INFO L225 Difference]: With dead ends: 141 [2019-09-20 13:01:27,824 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:01:27,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:01:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-09-20 13:01:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-20 13:01:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-20 13:01:27,832 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2019-09-20 13:01:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,833 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-20 13:01:27,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-20 13:01:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:01:27,834 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,834 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,835 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2019-09-20 13:01:27,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:27,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:27,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:27,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:27,878 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2019-09-20 13:01:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:27,904 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-09-20 13:01:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:27,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:01:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:27,907 INFO L225 Difference]: With dead ends: 79 [2019-09-20 13:01:27,907 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 13:01:27,908 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 13:01:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-20 13:01:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 13:01:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-09-20 13:01:27,920 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2019-09-20 13:01:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:27,922 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-09-20 13:01:27,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-09-20 13:01:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:01:27,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:27,927 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:27,927 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2019-09-20 13:01:27,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:27,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:28,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:28,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:01:28,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:01:28,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:01:28,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:28,008 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-09-20 13:01:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:28,086 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-09-20 13:01:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:01:28,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-20 13:01:28,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:28,088 INFO L225 Difference]: With dead ends: 78 [2019-09-20 13:01:28,088 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:01:28,088 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:01:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:01:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-20 13:01:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 13:01:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-09-20 13:01:28,094 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2019-09-20 13:01:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:28,095 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-09-20 13:01:28,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:01:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-09-20 13:01:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:01:28,096 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:28,096 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:28,097 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-09-20 13:01:28,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:28,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:28,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:28,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:28,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:01:28,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:01:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:01:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:28,193 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2019-09-20 13:01:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:28,436 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-09-20 13:01:28,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:01:28,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-20 13:01:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:28,438 INFO L225 Difference]: With dead ends: 179 [2019-09-20 13:01:28,438 INFO L226 Difference]: Without dead ends: 137 [2019-09-20 13:01:28,439 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:01:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-20 13:01:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-09-20 13:01:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-20 13:01:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-09-20 13:01:28,445 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-09-20 13:01:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:28,445 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-09-20 13:01:28,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:01:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-09-20 13:01:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:01:28,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:28,446 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:28,447 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-09-20 13:01:28,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:28,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:28,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:28,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:28,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:01:28,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:01:28,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:01:28,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:01:28,721 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2019-09-20 13:01:29,249 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-20 13:01:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:29,755 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-09-20 13:01:29,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:01:29,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-20 13:01:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:29,758 INFO L225 Difference]: With dead ends: 175 [2019-09-20 13:01:29,759 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:01:29,759 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:01:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:01:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2019-09-20 13:01:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 13:01:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-09-20 13:01:29,768 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-09-20 13:01:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:29,768 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-09-20 13:01:29,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:01:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-09-20 13:01:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:01:29,769 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:29,770 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:29,770 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:29,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-09-20 13:01:29,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:29,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:29,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:01:29,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:29,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:29,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:29,831 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 5 states. [2019-09-20 13:01:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:29,947 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2019-09-20 13:01:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:29,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-20 13:01:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:29,949 INFO L225 Difference]: With dead ends: 151 [2019-09-20 13:01:29,950 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 13:01:29,950 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 13:01:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-09-20 13:01:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-20 13:01:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-09-20 13:01:29,961 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-09-20 13:01:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:29,961 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-09-20 13:01:29,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-09-20 13:01:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:01:29,962 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:29,963 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:29,963 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-09-20 13:01:29,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:29,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:29,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:29,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:01:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:30,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:30,011 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 3 states. [2019-09-20 13:01:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:30,061 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-09-20 13:01:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:30,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:01:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:30,063 INFO L225 Difference]: With dead ends: 125 [2019-09-20 13:01:30,063 INFO L226 Difference]: Without dead ends: 123 [2019-09-20 13:01:30,064 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-20 13:01:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-20 13:01:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 13:01:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-09-20 13:01:30,071 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-09-20 13:01:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:30,072 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-09-20 13:01:30,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-09-20 13:01:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:01:30,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:30,079 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:30,080 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:30,080 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-09-20 13:01:30,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:30,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:30,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:30,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:30,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:30,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:01:30,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:01:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:01:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:01:30,332 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-09-20 13:01:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:31,006 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-09-20 13:01:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:01:31,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-20 13:01:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:31,008 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:01:31,008 INFO L226 Difference]: Without dead ends: 199 [2019-09-20 13:01:31,009 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:01:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-20 13:01:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2019-09-20 13:01:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-20 13:01:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-09-20 13:01:31,018 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-09-20 13:01:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:31,018 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-09-20 13:01:31,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:01:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-09-20 13:01:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:01:31,019 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:31,019 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:31,020 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:31,020 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-09-20 13:01:31,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:31,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:31,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:31,072 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:31,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:31,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 13:01:31,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:31,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-09-20 13:01:31,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-09-20 13:01:31,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,296 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2019-09-20 13:01:31,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,329 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 30 treesize of output 32 [2019-09-20 13:01:31,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:31,354 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 30 treesize of output 32 [2019-09-20 13:01:31,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-09-20 13:01:31,434 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 29 treesize of output 13 [2019-09-20 13:01:31,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,448 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 3 case distinctions, treesize of input 29 treesize of output 13 [2019-09-20 13:01:31,449 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:31,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:31,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-09-20 13:01:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:31,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:31,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-20 13:01:31,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:01:31,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:01:31,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:01:31,470 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 8 states. [2019-09-20 13:01:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:31,805 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-09-20 13:01:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:01:31,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-20 13:01:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:31,806 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:01:31,807 INFO L226 Difference]: Without dead ends: 160 [2019-09-20 13:01:31,807 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:01:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-20 13:01:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2019-09-20 13:01:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:01:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-09-20 13:01:31,826 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-09-20 13:01:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:31,828 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-09-20 13:01:31,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:01:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-09-20 13:01:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:01:31,829 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:31,830 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:31,830 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-09-20 13:01:31,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:32,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:01:32,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:01:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:01:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:32,008 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 6 states. [2019-09-20 13:01:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:32,229 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2019-09-20 13:01:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:32,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-20 13:01:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:32,232 INFO L225 Difference]: With dead ends: 161 [2019-09-20 13:01:32,232 INFO L226 Difference]: Without dead ends: 141 [2019-09-20 13:01:32,233 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-20 13:01:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2019-09-20 13:01:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-20 13:01:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-09-20 13:01:32,242 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 33 [2019-09-20 13:01:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:32,242 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-09-20 13:01:32,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:01:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-09-20 13:01:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:01:32,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:32,243 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:32,244 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:32,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-09-20 13:01:32,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:32,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:32,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:01:32,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:01:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:01:32,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:01:32,294 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 3 states. [2019-09-20 13:01:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:32,313 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2019-09-20 13:01:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:01:32,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:01:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:32,314 INFO L225 Difference]: With dead ends: 224 [2019-09-20 13:01:32,314 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:01:32,318 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:01:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:01:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-09-20 13:01:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-20 13:01:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-09-20 13:01:32,328 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2019-09-20 13:01:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:32,328 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-09-20 13:01:32,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:01:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-09-20 13:01:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:01:32,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:32,329 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:32,330 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-09-20 13:01:32,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:32,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:32,428 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:32,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-20 13:01:32,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:32,548 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-09-20 13:01:32,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,566 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-09-20 13:01:32,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,577 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-09-20 13:01:32,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:32,687 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-09-20 13:01:32,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,706 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-09-20 13:01:32,707 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-09-20 13:01:32,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:32,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:32,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-09-20 13:01:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:32,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:32,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-20 13:01:32,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:01:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:01:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:01:32,725 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 10 states. [2019-09-20 13:01:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:33,026 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2019-09-20 13:01:33,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:01:33,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-09-20 13:01:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:33,028 INFO L225 Difference]: With dead ends: 268 [2019-09-20 13:01:33,028 INFO L226 Difference]: Without dead ends: 224 [2019-09-20 13:01:33,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:01:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-20 13:01:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2019-09-20 13:01:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-20 13:01:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2019-09-20 13:01:33,040 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 36 [2019-09-20 13:01:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:33,041 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2019-09-20 13:01:33,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:01:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2019-09-20 13:01:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:01:33,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:33,042 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:33,042 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1341973316, now seen corresponding path program 1 times [2019-09-20 13:01:33,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:33,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:33,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:33,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:33,261 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:33,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:33,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 13:01:33,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:33,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:33,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:01:33,433 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-09-20 13:01:33,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,445 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-09-20 13:01:33,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-09-20 13:01:33,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,498 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-09-20 13:01:33,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,542 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_41|], 16=[|v_#memory_$Pointer$.base_41|]} [2019-09-20 13:01:33,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,564 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:33,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,590 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 73 treesize of output 58 [2019-09-20 13:01:33,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,652 INFO L567 ElimStorePlain]: treesize reduction 22, result has 86.8 percent of original size [2019-09-20 13:01:33,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,729 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 3 case distinctions, treesize of input 76 treesize of output 123 [2019-09-20 13:01:33,730 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,817 INFO L567 ElimStorePlain]: treesize reduction 78, result has 50.9 percent of original size [2019-09-20 13:01:33,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,819 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:191, output treesize:95 [2019-09-20 13:01:33,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:33,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:33,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:33,971 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 4 case distinctions, treesize of input 131 treesize of output 227 [2019-09-20 13:01:33,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:33,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:33,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:33,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:34,159 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-20 13:01:34,159 INFO L341 Elim1Store]: treesize reduction 60, result has 74.5 percent of original size [2019-09-20 13:01:34,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 245 [2019-09-20 13:01:34,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:34,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:34,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:34,523 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-20 13:01:34,524 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 15.2 percent of original size [2019-09-20 13:01:34,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:34,693 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-20 13:01:34,694 INFO L341 Elim1Store]: treesize reduction 66, result has 72.6 percent of original size [2019-09-20 13:01:34,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 267 [2019-09-20 13:01:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,716 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:34,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:34,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:34,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 225 [2019-09-20 13:01:34,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:34,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:34,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:34,825 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:35,084 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2019-09-20 13:01:35,084 INFO L567 ElimStorePlain]: treesize reduction 1107, result has 16.5 percent of original size [2019-09-20 13:01:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,088 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 2 xjuncts. [2019-09-20 13:01:35,088 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:260, output treesize:223 [2019-09-20 13:01:35,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,669 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-20 13:01:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:35,699 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_2, v_prenex_3, v_prenex_5, v_prenex_6], 18=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-09-20 13:01:35,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:35,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,736 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 5 case distinctions, treesize of input 105 treesize of output 132 [2019-09-20 13:01:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,739 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:35,870 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-09-20 13:01:35,870 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.3 percent of original size [2019-09-20 13:01:35,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,881 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-09-20 13:01:35,882 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:35,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:35,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:35,985 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 5 case distinctions, treesize of input 105 treesize of output 132 [2019-09-20 13:01:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:35,990 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:36,120 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-20 13:01:36,121 INFO L567 ElimStorePlain]: treesize reduction 36, result has 83.3 percent of original size [2019-09-20 13:01:36,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,129 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-09-20 13:01:36,130 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,308 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-20 13:01:36,308 INFO L341 Elim1Store]: treesize reduction 10, result has 92.2 percent of original size [2019-09-20 13:01:36,309 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 184 [2019-09-20 13:01:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,353 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:36,444 INFO L567 ElimStorePlain]: treesize reduction 88, result has 54.2 percent of original size [2019-09-20 13:01:36,465 INFO L341 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2019-09-20 13:01:36,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 68 [2019-09-20 13:01:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,468 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,485 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:330, output treesize:7 [2019-09-20 13:01:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:36,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:36,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-20 13:01:36,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:01:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:01:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=115, Unknown=1, NotChecked=0, Total=156 [2019-09-20 13:01:36,520 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 13 states. [2019-09-20 13:01:36,920 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-20 13:01:37,409 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-09-20 13:01:37,678 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-09-20 13:01:37,924 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-20 13:01:38,121 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-20 13:01:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:38,459 INFO L93 Difference]: Finished difference Result 449 states and 525 transitions. [2019-09-20 13:01:38,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:01:38,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-20 13:01:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:38,461 INFO L225 Difference]: With dead ends: 449 [2019-09-20 13:01:38,462 INFO L226 Difference]: Without dead ends: 361 [2019-09-20 13:01:38,464 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=560, Unknown=3, NotChecked=0, Total=756 [2019-09-20 13:01:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-20 13:01:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 191. [2019-09-20 13:01:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:01:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-09-20 13:01:38,481 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 40 [2019-09-20 13:01:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:38,481 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-09-20 13:01:38,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:01:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-09-20 13:01:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:01:38,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:38,483 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:38,488 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:38,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2026576836, now seen corresponding path program 1 times [2019-09-20 13:01:38,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:38,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:39,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:39,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:39,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-20 13:01:39,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:39,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:39,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:01:39,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,326 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-09-20 13:01:39,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,414 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-20 13:01:39,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:39,434 INFO L341 Elim1Store]: treesize reduction 87, result has 9.4 percent of original size [2019-09-20 13:01:39,436 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 271 treesize of output 193 [2019-09-20 13:01:39,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-09-20 13:01:39,474 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,492 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-09-20 13:01:39,492 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-20 13:01:39,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,611 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 22 treesize of output 32 [2019-09-20 13:01:39,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:39,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,721 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 98 treesize of output 85 [2019-09-20 13:01:39,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,845 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-20 13:01:39,845 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.7 percent of original size [2019-09-20 13:01:39,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,881 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:39,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,924 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 5 case distinctions, treesize of input 135 treesize of output 137 [2019-09-20 13:01:39,926 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,075 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-20 13:01:40,075 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.0 percent of original size [2019-09-20 13:01:40,076 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-09-20 13:01:40,076 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-09-20 13:01:40,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:40,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:40,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-09-20 13:01:40,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,211 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:40,371 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-20 13:01:40,372 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-09-20 13:01:40,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:40,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:40,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:40,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-09-20 13:01:40,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-09-20 13:01:40,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:40,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:40,809 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-20 13:01:40,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 165 treesize of output 132 [2019-09-20 13:01:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:40,824 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:40,893 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-09-20 13:01:40,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 46 [2019-09-20 13:01:40,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:40,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:40,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:7 [2019-09-20 13:01:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-09-20 13:01:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:01:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:01:40,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:01:40,970 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 19 states. [2019-09-20 13:01:41,709 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-20 13:01:42,184 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-20 13:01:42,437 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-09-20 13:01:42,698 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2019-09-20 13:01:42,922 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-09-20 13:01:43,053 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-20 13:01:43,486 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-09-20 13:01:43,843 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-09-20 13:01:44,115 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-20 13:01:44,421 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-09-20 13:01:44,743 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-20 13:01:45,314 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-20 13:01:45,639 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-20 13:01:45,982 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-20 13:01:46,329 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-20 13:01:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:46,457 INFO L93 Difference]: Finished difference Result 752 states and 865 transitions. [2019-09-20 13:01:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-20 13:01:46,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-20 13:01:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:46,461 INFO L225 Difference]: With dead ends: 752 [2019-09-20 13:01:46,461 INFO L226 Difference]: Without dead ends: 750 [2019-09-20 13:01:46,462 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=602, Invalid=1750, Unknown=0, NotChecked=0, Total=2352 [2019-09-20 13:01:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-20 13:01:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 225. [2019-09-20 13:01:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-20 13:01:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2019-09-20 13:01:46,482 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 40 [2019-09-20 13:01:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:46,482 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2019-09-20 13:01:46,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:01:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2019-09-20 13:01:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-20 13:01:46,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:46,483 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:46,483 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:46,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199972, now seen corresponding path program 1 times [2019-09-20 13:01:46,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:46,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:46,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:46,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:01:46,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:01:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:01:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:46,528 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 5 states. [2019-09-20 13:01:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:46,609 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-09-20 13:01:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:01:46,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-20 13:01:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:46,610 INFO L225 Difference]: With dead ends: 291 [2019-09-20 13:01:46,610 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 13:01:46,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:01:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 13:01:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-20 13:01:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:01:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-09-20 13:01:46,623 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 42 [2019-09-20 13:01:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:46,623 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-09-20 13:01:46,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:01:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-09-20 13:01:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 13:01:46,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:46,624 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:46,624 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-09-20 13:01:46,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:46,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:46,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:47,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:47,185 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:47,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:47,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-20 13:01:47,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:47,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:47,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:01:47,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,342 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-09-20 13:01:47,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,414 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-09-20 13:01:47,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,433 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-09-20 13:01:47,433 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 141 treesize of output 130 [2019-09-20 13:01:47,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2019-09-20 13:01:47,463 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,486 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-09-20 13:01:47,487 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-09-20 13:01:47,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,608 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 22 treesize of output 32 [2019-09-20 13:01:47,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,696 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:47,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:47,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,735 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 5 case distinctions, treesize of input 135 treesize of output 137 [2019-09-20 13:01:47,736 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:47,904 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-20 13:01:47,905 INFO L567 ElimStorePlain]: treesize reduction 132, result has 59.4 percent of original size [2019-09-20 13:01:47,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:47,928 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:47,928 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 98 treesize of output 85 [2019-09-20 13:01:47,929 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,019 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.8 percent of original size [2019-09-20 13:01:48,020 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-09-20 13:01:48,020 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-09-20 13:01:48,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:48,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:48,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-09-20 13:01:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,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-09-20 13:01:48,297 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-20 13:01:48,297 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-09-20 13:01:48,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:48,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:48,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:48,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-09-20 13:01:48,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-09-20 13:01:48,761 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-09-20 13:01:48,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 161 treesize of output 130 [2019-09-20 13:01:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:48,783 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:48,866 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.4 percent of original size [2019-09-20 13:01:48,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-09-20 13:01:48,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,891 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:7 [2019-09-20 13:01:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:48,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:48,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-09-20 13:01:48,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:01:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:01:48,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:01:48,956 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 19 states. [2019-09-20 13:01:49,536 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-20 13:01:49,921 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-20 13:01:50,333 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-20 13:01:50,608 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-09-20 13:01:50,988 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-09-20 13:01:51,283 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 111 [2019-09-20 13:01:51,499 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-09-20 13:01:51,997 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-09-20 13:01:52,375 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-20 13:01:52,657 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-09-20 13:01:52,981 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-09-20 13:01:53,238 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-20 13:01:53,559 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-20 13:01:54,110 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-20 13:01:54,270 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-20 13:01:54,672 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-20 13:01:54,991 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-20 13:01:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:55,529 INFO L93 Difference]: Finished difference Result 579 states and 633 transitions. [2019-09-20 13:01:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-20 13:01:55,530 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2019-09-20 13:01:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:55,534 INFO L225 Difference]: With dead ends: 579 [2019-09-20 13:01:55,534 INFO L226 Difference]: Without dead ends: 577 [2019-09-20 13:01:55,536 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=662, Invalid=1888, Unknown=0, NotChecked=0, Total=2550 [2019-09-20 13:01:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-20 13:01:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 203. [2019-09-20 13:01:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-20 13:01:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 233 transitions. [2019-09-20 13:01:55,556 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 233 transitions. Word has length 43 [2019-09-20 13:01:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:55,556 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 233 transitions. [2019-09-20 13:01:55,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:01:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 233 transitions. [2019-09-20 13:01:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:01:55,557 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:55,557 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:55,558 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash 938403788, now seen corresponding path program 1 times [2019-09-20 13:01:55,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:55,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:55,921 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-20 13:01:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:56,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:56,206 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:56,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:56,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-20 13:01:56,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:56,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 54 [2019-09-20 13:01:56,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:56,436 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:56,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:56,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:56,651 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-20 13:01:56,658 INFO L168 Benchmark]: Toolchain (without parser) took 31996.51 ms. Allocated memory was 133.2 MB in the beginning and 500.2 MB in the end (delta: 367.0 MB). Free memory was 88.4 MB in the beginning and 84.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 370.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:01:56,659 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:01:56,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.78 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 88.2 MB in the beginning and 165.0 MB in the end (delta: -76.7 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:01:56,659 INFO L168 Benchmark]: Boogie Preprocessor took 90.22 ms. Allocated memory is still 200.3 MB. Free memory was 165.0 MB in the beginning and 161.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:01:56,660 INFO L168 Benchmark]: RCFGBuilder took 792.20 ms. Allocated memory is still 200.3 MB. Free memory was 161.2 MB in the beginning and 106.1 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:01:56,660 INFO L168 Benchmark]: TraceAbstraction took 30464.33 ms. Allocated memory was 200.3 MB in the beginning and 500.2 MB in the end (delta: 299.9 MB). Free memory was 105.4 MB in the beginning and 84.9 MB in the end (delta: 20.5 MB). Peak memory consumption was 320.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:01:56,662 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 644.78 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 88.2 MB in the beginning and 165.0 MB in the end (delta: -76.7 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.22 ms. Allocated memory is still 200.3 MB. Free memory was 165.0 MB in the beginning and 161.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.20 ms. Allocated memory is still 200.3 MB. Free memory was 161.2 MB in the beginning and 106.1 MB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30464.33 ms. Allocated memory was 200.3 MB in the beginning and 500.2 MB in the end (delta: 299.9 MB). Free memory was 105.4 MB in the beginning and 84.9 MB in the end (delta: 20.5 MB). Peak memory consumption was 320.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...