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/list-ext3-properties/sll_of_sll_nondet_append-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:11:03,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:11:03,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:11:03,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:11:03,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:11:03,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:11:03,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:11:03,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:11:03,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:11:03,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:11:03,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:11:03,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:11:03,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:11:03,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:11:03,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:11:03,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:11:03,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:11:03,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:11:03,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:11:03,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:11:03,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:11:03,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:11:03,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:11:03,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:11:03,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:11:03,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:11:03,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:11:03,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:11:03,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:11:03,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:11:03,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:11:03,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:11:03,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:11:03,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:11:03,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:11:03,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:11:03,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:11:03,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:11:03,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:11:03,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:11:03,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:11:03,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:11:03,680 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:11:03,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:11:03,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:11:03,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:11:03,683 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:11:03,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:11:03,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:11:03,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:11:03,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:11:03,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:11:03,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:11:03,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:11:03,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:11:03,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:11:03,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:11:03,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:11:03,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:11:03,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:11:03,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:11:03,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:11:03,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:11:03,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:03,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:11:03,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:11:03,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:11:03,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:11:03,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:11:03,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:11:03,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:11:03,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:11:03,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:11:03,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:11:03,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:11:03,991 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:11:03,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.i [2019-10-14 23:11:04,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba6e7123/665796d28f2344bba1f368c145d1b534/FLAGa7013aece [2019-10-14 23:11:04,555 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:11:04,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.i [2019-10-14 23:11:04,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba6e7123/665796d28f2344bba1f368c145d1b534/FLAGa7013aece [2019-10-14 23:11:04,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba6e7123/665796d28f2344bba1f368c145d1b534 [2019-10-14 23:11:04,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:11:04,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:11:04,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:04,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:11:04,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:11:04,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:04" (1/1) ... [2019-10-14 23:11:04,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c9a76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:04, skipping insertion in model container [2019-10-14 23:11:04,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:04" (1/1) ... [2019-10-14 23:11:04,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:11:04,978 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:11:05,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:05,441 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:11:05,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:05,584 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:11:05,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05 WrapperNode [2019-10-14 23:11:05,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:05,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:11:05,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:11:05,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:11:05,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... [2019-10-14 23:11:05,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:11:05,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:11:05,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:11:05,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:11:05,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:11:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:11:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:11:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:11:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:11:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-14 23:11:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2019-10-14 23:11:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-10-14 23:11:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2019-10-14 23:11:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2019-10-14 23:11:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:11:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:11:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:11:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:11:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:11:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:11:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:11:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:11:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:11:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:11:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:11:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:11:05,731 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:11:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:11:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:11:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:11:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:11:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:11:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:11:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:11:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:11:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:11:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:11:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:11:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:11:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:11:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:11:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:11:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:11:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:11:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:11:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:11:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:11:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:11:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:11:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:11:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:11:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:11:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:11:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:11:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:11:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:11:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:11:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:11:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:11:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:11:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:11:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:11:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:11:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:11:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:11:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-14 23:11:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:11:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:11:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2019-10-14 23:11:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-10-14 23:11:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:11:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2019-10-14 23:11:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2019-10-14 23:11:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:11:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:11:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:11:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-14 23:11:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:11:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:11:06,176 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:11:06,472 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:11:06,472 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-14 23:11:06,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:06 BoogieIcfgContainer [2019-10-14 23:11:06,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:11:06,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:11:06,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:11:06,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:11:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:04" (1/3) ... [2019-10-14 23:11:06,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bff48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:06, skipping insertion in model container [2019-10-14 23:11:06,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:05" (2/3) ... [2019-10-14 23:11:06,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bff48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:06, skipping insertion in model container [2019-10-14 23:11:06,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:06" (3/3) ... [2019-10-14 23:11:06,482 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2019-10-14 23:11:06,492 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:11:06,500 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:11:06,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:11:06,537 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:11:06,538 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:11:06,538 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:11:06,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:11:06,539 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:11:06,539 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:11:06,539 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:11:06,539 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:11:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-10-14 23:11:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 23:11:06,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:06,564 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:06,566 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:06,571 INFO L82 PathProgramCache]: Analyzing trace with hash 881770505, now seen corresponding path program 1 times [2019-10-14 23:11:06,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:06,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570977752] [2019-10-14 23:11:06,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:06,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:06,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:06,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570977752] [2019-10-14 23:11:06,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:06,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:11:06,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049475254] [2019-10-14 23:11:06,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:11:06,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:11:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:11:06,781 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-10-14 23:11:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:07,007 INFO L93 Difference]: Finished difference Result 141 states and 202 transitions. [2019-10-14 23:11:07,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:11:07,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-14 23:11:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:07,020 INFO L225 Difference]: With dead ends: 141 [2019-10-14 23:11:07,020 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 23:11:07,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:11:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 23:11:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-10-14 23:11:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 23:11:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-10-14 23:11:07,068 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2019-10-14 23:11:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:07,068 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-10-14 23:11:07,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:11:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-10-14 23:11:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 23:11:07,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:07,069 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:07,069 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 857758959, now seen corresponding path program 1 times [2019-10-14 23:11:07,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:07,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447581745] [2019-10-14 23:11:07,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,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-10-14 23:11:07,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447581745] [2019-10-14 23:11:07,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:07,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:11:07,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177469487] [2019-10-14 23:11:07,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:07,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:07,157 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 4 states. [2019-10-14 23:11:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:07,335 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-10-14 23:11:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:07,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-14 23:11:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:07,337 INFO L225 Difference]: With dead ends: 80 [2019-10-14 23:11:07,338 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:11:07,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:11:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-10-14 23:11:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:11:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-10-14 23:11:07,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 11 [2019-10-14 23:11:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:07,361 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-10-14 23:11:07,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-10-14 23:11:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:11:07,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:07,363 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:07,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1045120254, now seen corresponding path program 1 times [2019-10-14 23:11:07,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:07,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644430708] [2019-10-14 23:11:07,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:11:07,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644430708] [2019-10-14 23:11:07,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:07,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:11:07,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323914615] [2019-10-14 23:11:07,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:11:07,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:11:07,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:11:07,469 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 5 states. [2019-10-14 23:11:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:07,644 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2019-10-14 23:11:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:07,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:11:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:07,646 INFO L225 Difference]: With dead ends: 83 [2019-10-14 23:11:07,647 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:11:07,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:11:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-10-14 23:11:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:11:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-10-14 23:11:07,657 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2019-10-14 23:11:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:07,657 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-10-14 23:11:07,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:11:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-10-14 23:11:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:07,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:07,659 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:07,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:07,660 INFO L82 PathProgramCache]: Analyzing trace with hash 685223862, now seen corresponding path program 1 times [2019-10-14 23:11:07,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:07,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848140361] [2019-10-14 23:11:07,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:07,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:07,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848140361] [2019-10-14 23:11:07,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:07,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:11:07,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151806632] [2019-10-14 23:11:07,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:11:07,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:11:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:11:07,999 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 11 states. [2019-10-14 23:11:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:08,384 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2019-10-14 23:11:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:11:08,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-10-14 23:11:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:08,386 INFO L225 Difference]: With dead ends: 130 [2019-10-14 23:11:08,386 INFO L226 Difference]: Without dead ends: 84 [2019-10-14 23:11:08,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:11:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-14 23:11:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-10-14 23:11:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 23:11:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-10-14 23:11:08,400 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 38 [2019-10-14 23:11:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:08,400 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-10-14 23:11:08,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:11:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-10-14 23:11:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:11:08,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:08,404 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:08,404 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash -27576761, now seen corresponding path program 2 times [2019-10-14 23:11:08,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:08,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116527239] [2019-10-14 23:11:08,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:08,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:08,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:08,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116527239] [2019-10-14 23:11:08,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374906622] [2019-10-14 23:11:08,715 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:08,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-14 23:11:08,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:08,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:11:08,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 23:11:08,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:11:08,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 18 [2019-10-14 23:11:08,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177315178] [2019-10-14 23:11:08,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:08,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:08,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:08,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:11:08,927 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-10-14 23:11:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:08,994 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-10-14 23:11:08,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:08,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-14 23:11:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:08,997 INFO L225 Difference]: With dead ends: 95 [2019-10-14 23:11:08,997 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 23:11:08,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:11:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 23:11:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2019-10-14 23:11:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-14 23:11:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-10-14 23:11:09,011 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 43 [2019-10-14 23:11:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:09,012 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-10-14 23:11:09,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-10-14 23:11:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 23:11:09,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:09,014 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:09,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:09,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:09,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1977264063, now seen corresponding path program 1 times [2019-10-14 23:11:09,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:09,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775177415] [2019-10-14 23:11:09,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:09,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:11:09,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775177415] [2019-10-14 23:11:09,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79572782] [2019-10-14 23:11:09,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:09,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 23:11:09,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:09,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:11:09,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 18 [2019-10-14 23:11:09,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510471337] [2019-10-14 23:11:09,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:11:09,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:11:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:11:09,764 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 10 states. [2019-10-14 23:11:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:09,990 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2019-10-14 23:11:09,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:11:09,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-14 23:11:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:09,992 INFO L225 Difference]: With dead ends: 159 [2019-10-14 23:11:09,993 INFO L226 Difference]: Without dead ends: 84 [2019-10-14 23:11:09,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:11:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-14 23:11:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2019-10-14 23:11:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 23:11:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-10-14 23:11:10,005 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 54 [2019-10-14 23:11:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:10,005 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-10-14 23:11:10,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:11:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-10-14 23:11:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 23:11:10,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:10,008 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:10,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,224 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1552707912, now seen corresponding path program 1 times [2019-10-14 23:11:10,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:10,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264696488] [2019-10-14 23:11:10,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264696488] [2019-10-14 23:11:10,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74567214] [2019-10-14 23:11:10,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 23:11:10,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:10,746 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:10,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-10-14 23:11:10,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210905333] [2019-10-14 23:11:10,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 23:11:10,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 23:11:10,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:11:10,751 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 18 states. [2019-10-14 23:11:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:11,278 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2019-10-14 23:11:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:11:11,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-10-14 23:11:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:11,280 INFO L225 Difference]: With dead ends: 147 [2019-10-14 23:11:11,280 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 23:11:11,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:11:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 23:11:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-10-14 23:11:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 23:11:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2019-10-14 23:11:11,298 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 52 [2019-10-14 23:11:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:11,298 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2019-10-14 23:11:11,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 23:11:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2019-10-14 23:11:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:11:11,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:11,300 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:11,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:11,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 184700400, now seen corresponding path program 2 times [2019-10-14 23:11:11,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:11,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083293713] [2019-10-14 23:11:11,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:11,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:11,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:11,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083293713] [2019-10-14 23:11:11,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401861538] [2019-10-14 23:11:11,759 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:11,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:11,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:11,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 23:11:11,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:11,987 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:11,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2019-10-14 23:11:11,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066534994] [2019-10-14 23:11:11,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 23:11:11,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 23:11:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:11:11,989 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 19 states. [2019-10-14 23:11:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:12,579 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2019-10-14 23:11:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:11:12,583 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-10-14 23:11:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:12,584 INFO L225 Difference]: With dead ends: 164 [2019-10-14 23:11:12,584 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 23:11:12,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:11:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 23:11:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-10-14 23:11:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 23:11:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-10-14 23:11:12,594 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 55 [2019-10-14 23:11:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:12,594 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-10-14 23:11:12,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 23:11:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-10-14 23:11:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:11:12,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:12,599 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:12,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:12,811 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash 664839096, now seen corresponding path program 3 times [2019-10-14 23:11:12,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:12,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059942827] [2019-10-14 23:11:12,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:12,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:12,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 23:11:12,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059942827] [2019-10-14 23:11:12,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760266836] [2019-10-14 23:11:12,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:13,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-14 23:11:13,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:13,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:11:13,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 23:11:13,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:13,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-14 23:11:13,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232542426] [2019-10-14 23:11:13,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:11:13,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:11:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:11:13,094 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 8 states. [2019-10-14 23:11:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:13,241 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2019-10-14 23:11:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:13,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-14 23:11:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:13,244 INFO L225 Difference]: With dead ends: 127 [2019-10-14 23:11:13,244 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 23:11:13,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:11:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 23:11:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2019-10-14 23:11:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-14 23:11:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2019-10-14 23:11:13,254 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 58 [2019-10-14 23:11:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:13,254 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2019-10-14 23:11:13,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:11:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2019-10-14 23:11:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-14 23:11:13,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:13,256 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:13,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:13,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1355298761, now seen corresponding path program 4 times [2019-10-14 23:11:13,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:13,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941311792] [2019-10-14 23:11:13,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:13,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:13,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:11:13,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941311792] [2019-10-14 23:11:13,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811682448] [2019-10-14 23:11:13,712 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:13,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:11:13,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:13,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 23:11:13,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:13,954 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:13,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2019-10-14 23:11:13,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927156600] [2019-10-14 23:11:13,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:11:13,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:11:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:11:13,956 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 21 states. [2019-10-14 23:11:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:14,684 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2019-10-14 23:11:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:11:14,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2019-10-14 23:11:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:14,686 INFO L225 Difference]: With dead ends: 182 [2019-10-14 23:11:14,686 INFO L226 Difference]: Without dead ends: 118 [2019-10-14 23:11:14,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:11:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-14 23:11:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-10-14 23:11:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-14 23:11:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-10-14 23:11:14,696 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 63 [2019-10-14 23:11:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:14,697 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-10-14 23:11:14,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:11:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-10-14 23:11:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:11:14,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:14,698 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:14,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:14,909 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1173831873, now seen corresponding path program 5 times [2019-10-14 23:11:14,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:14,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225340722] [2019-10-14 23:11:14,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:14,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:14,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-14 23:11:15,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225340722] [2019-10-14 23:11:15,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554108028] [2019-10-14 23:11:15,014 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:15,214 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-14 23:11:15,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:15,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 23:11:15,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:11:15,414 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:15,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 20 [2019-10-14 23:11:15,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358567350] [2019-10-14 23:11:15,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:11:15,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:11:15,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:11:15,416 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 20 states. [2019-10-14 23:11:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:16,149 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2019-10-14 23:11:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 23:11:16,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-10-14 23:11:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:16,151 INFO L225 Difference]: With dead ends: 186 [2019-10-14 23:11:16,152 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 23:11:16,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-10-14 23:11:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 23:11:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2019-10-14 23:11:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-14 23:11:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2019-10-14 23:11:16,166 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 66 [2019-10-14 23:11:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:16,166 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2019-10-14 23:11:16,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:11:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2019-10-14 23:11:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-14 23:11:16,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:16,168 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:16,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:16,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1522769064, now seen corresponding path program 6 times [2019-10-14 23:11:16,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:16,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663136418] [2019-10-14 23:11:16,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:16,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:16,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:11:17,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663136418] [2019-10-14 23:11:17,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105017795] [2019-10-14 23:11:17,236 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:17,392 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-14 23:11:17,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:17,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-14 23:11:17,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:17,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:17,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:17,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:17,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:17,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:17,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:17,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:17,689 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 45 treesize of output 45 [2019-10-14 23:11:17,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:17,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:17,702 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 45 treesize of output 45 [2019-10-14 23:11:17,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:17,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:17,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:17,757 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 45 treesize of output 45 [2019-10-14 23:11:17,758 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:17,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:17,765 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 45 treesize of output 45 [2019-10-14 23:11:17,766 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:17,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:17,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:11:17,809 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:67 [2019-10-14 23:11:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:17,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:18,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2019-10-14 23:11:18,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2019-10-14 23:11:18,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:18,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:18,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-10-14 23:11:18,090 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-10-14 23:11:18,099 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:18,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:11:18,142 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:79 [2019-10-14 23:11:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:18,241 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, v_prenex_3], 4=[v_prenex_2, |v_#memory_$Pointer$.base_32|]} [2019-10-14 23:11:18,271 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:18,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 73 [2019-10-14 23:11:18,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,359 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.2 percent of original size [2019-10-14 23:11:18,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:18,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 73 [2019-10-14 23:11:18,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,478 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.3 percent of original size [2019-10-14 23:11:18,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:18,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 104 [2019-10-14 23:11:18,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:18,567 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,679 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-14 23:11:18,680 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-10-14 23:11:18,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:18,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 96 [2019-10-14 23:11:18,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:18,731 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:18,857 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-14 23:11:18,858 INFO L567 ElimStorePlain]: treesize reduction 32, result has 78.5 percent of original size [2019-10-14 23:11:18,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:11:18,859 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:101, output treesize:151 [2019-10-14 23:11:19,016 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-10-14 23:11:19,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,043 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 59 treesize of output 63 [2019-10-14 23:11:19,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,049 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:19,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2019-10-14 23:11:19,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:19,056 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2019-10-14 23:11:19,056 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,063 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-14 23:11:19,064 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,075 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 59 treesize of output 63 [2019-10-14 23:11:19,076 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,080 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-14 23:11:19,081 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:11:19,117 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:332, output treesize:107 [2019-10-14 23:11:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:19,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 57 [2019-10-14 23:11:19,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,379 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:19,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:19,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:19,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 56 [2019-10-14 23:11:19,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:19,404 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:19,453 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.8 percent of original size [2019-10-14 23:11:19,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2019-10-14 23:11:19,478 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-10-14 23:11:19,487 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:19,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:19,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:11:19,497 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:169, output treesize:9 [2019-10-14 23:11:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-14 23:11:19,662 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:19,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 40 [2019-10-14 23:11:19,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341696945] [2019-10-14 23:11:19,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-14 23:11:19,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-14 23:11:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1467, Unknown=0, NotChecked=0, Total=1560 [2019-10-14 23:11:19,664 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand 40 states. [2019-10-14 23:11:20,937 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-14 23:11:21,200 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-14 23:11:22,009 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-10-14 23:11:22,306 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-14 23:11:22,937 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-10-14 23:11:23,250 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-14 23:11:23,502 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-14 23:11:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:24,957 INFO L93 Difference]: Finished difference Result 327 states and 462 transitions. [2019-10-14 23:11:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-14 23:11:24,958 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-10-14 23:11:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:24,962 INFO L225 Difference]: With dead ends: 327 [2019-10-14 23:11:24,962 INFO L226 Difference]: Without dead ends: 302 [2019-10-14 23:11:24,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=356, Invalid=4614, Unknown=0, NotChecked=0, Total=4970 [2019-10-14 23:11:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-14 23:11:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2019-10-14 23:11:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-14 23:11:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 271 transitions. [2019-10-14 23:11:25,003 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 271 transitions. Word has length 74 [2019-10-14 23:11:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:25,004 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 271 transitions. [2019-10-14 23:11:25,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-14 23:11:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 271 transitions. [2019-10-14 23:11:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-14 23:11:25,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:25,006 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:25,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:25,212 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash 977789968, now seen corresponding path program 1 times [2019-10-14 23:11:25,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:25,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067810233] [2019-10-14 23:11:25,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:25,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:25,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 23:11:27,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067810233] [2019-10-14 23:11:27,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207961314] [2019-10-14 23:11:27,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:27,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-14 23:11:27,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:27,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:27,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 23:11:27,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-10-14 23:11:27,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2019-10-14 23:11:28,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:28,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:28,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:75 [2019-10-14 23:11:28,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 215 [2019-10-14 23:11:28,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:44 [2019-10-14 23:11:28,462 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|], 4=[|v_#memory_$Pointer$.base_34|]} [2019-10-14 23:11:28,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:28,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-10-14 23:11:28,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:28,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-10-14 23:11:28,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,557 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-10-14 23:11:28,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:84 [2019-10-14 23:11:28,779 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_$Pointer$.base_35|]} [2019-10-14 23:11:28,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:28,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-10-14 23:11:28,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:28,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:28,845 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 3 case distinctions, treesize of input 67 treesize of output 66 [2019-10-14 23:11:28,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:28,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,901 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.9 percent of original size [2019-10-14 23:11:28,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:28,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:90 [2019-10-14 23:11:29,056 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_35|], 7=[|v_#memory_$Pointer$.base_36|]} [2019-10-14 23:11:29,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:29,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2019-10-14 23:11:29,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:29,175 INFO L567 ElimStorePlain]: treesize reduction 48, result has 65.0 percent of original size [2019-10-14 23:11:29,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:29,239 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 5 case distinctions, treesize of input 59 treesize of output 127 [2019-10-14 23:11:29,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:29,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:29,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:29,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,251 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:29,374 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-10-14 23:11:29,374 INFO L567 ElimStorePlain]: treesize reduction 80, result has 57.7 percent of original size [2019-10-14 23:11:29,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:29,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:146 [2019-10-14 23:11:29,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:29,985 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-14 23:11:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:30,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 135 [2019-10-14 23:11:30,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:30,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 86 [2019-10-14 23:11:30,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-14 23:11:30,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:158 [2019-10-14 23:11:30,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 23:11:30,967 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:30,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2019-10-14 23:11:30,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506169310] [2019-10-14 23:11:30,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-14 23:11:30,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-14 23:11:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2216, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 23:11:30,969 INFO L87 Difference]: Start difference. First operand 203 states and 271 transitions. Second operand 49 states. [2019-10-14 23:11:34,811 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-10-14 23:11:35,344 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-14 23:11:38,516 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-14 23:11:39,401 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-14 23:11:40,915 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-10-14 23:11:41,462 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-10-14 23:11:43,454 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2019-10-14 23:11:44,264 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-10-14 23:11:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:46,547 INFO L93 Difference]: Finished difference Result 518 states and 759 transitions. [2019-10-14 23:11:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-14 23:11:46,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 75 [2019-10-14 23:11:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:46,554 INFO L225 Difference]: With dead ends: 518 [2019-10-14 23:11:46,554 INFO L226 Difference]: Without dead ends: 471 [2019-10-14 23:11:46,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=524, Invalid=7848, Unknown=0, NotChecked=0, Total=8372 [2019-10-14 23:11:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-14 23:11:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 413. [2019-10-14 23:11:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-14 23:11:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 571 transitions. [2019-10-14 23:11:46,616 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 571 transitions. Word has length 75 [2019-10-14 23:11:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:46,616 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 571 transitions. [2019-10-14 23:11:46,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-14 23:11:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 571 transitions. [2019-10-14 23:11:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-14 23:11:46,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:46,619 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:46,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:46,824 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1185708632, now seen corresponding path program 2 times [2019-10-14 23:11:46,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:46,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722647394] [2019-10-14 23:11:46,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:46,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:46,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat