/usr/bin/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-fb55353 [2019-11-06 21:15:00,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:15:00,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:15:00,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:15:00,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:15:00,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:15:00,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:15:00,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:15:00,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:15:00,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:15:00,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:15:00,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:15:00,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:15:00,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:15:00,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:15:00,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:15:00,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:15:00,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:15:00,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:15:00,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:15:00,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:15:00,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:15:00,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:15:00,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:15:00,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:15:00,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:15:00,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:15:00,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:15:00,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:15:00,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:15:00,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:15:00,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:15:00,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:15:00,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:15:00,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:15:00,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:15:00,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:15:00,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:15:00,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:15:00,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:15:00,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:15:00,572 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-11-06 21:15:00,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:15:00,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:15:00,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:15:00,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:15:00,587 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:15:00,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:15:00,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:15:00,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:15:00,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:15:00,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:15:00,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:15:00,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:15:00,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:15:00,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:15:00,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:15:00,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:15:00,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:15:00,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:15:00,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:15:00,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:15:00,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:15:00,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:00,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:15:00,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:15:00,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:15:00,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:15:00,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:15:00,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:15:00,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:15:00,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:15:00,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:15:00,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:15:00,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:15:00,873 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:15:00,874 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-11-06 21:15:00,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606b3d2c9/2e3157fb9e9b49baa4bb7f4ff2d518f2/FLAG62e80936d [2019-11-06 21:15:01,510 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:15:01,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.i [2019-11-06 21:15:01,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606b3d2c9/2e3157fb9e9b49baa4bb7f4ff2d518f2/FLAG62e80936d [2019-11-06 21:15:01,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606b3d2c9/2e3157fb9e9b49baa4bb7f4ff2d518f2 [2019-11-06 21:15:01,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:15:01,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:15:01,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:01,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:15:01,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:15:01,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:01" (1/1) ... [2019-11-06 21:15:01,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373e4cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:01, skipping insertion in model container [2019-11-06 21:15:01,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:01" (1/1) ... [2019-11-06 21:15:01,825 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:15:01,884 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:15:02,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:02,383 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:15:02,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:02,524 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:15:02,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02 WrapperNode [2019-11-06 21:15:02,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:02,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:15:02,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:15:02,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:15:02,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (1/1) ... [2019-11-06 21:15:02,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:15:02,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:15:02,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:15:02,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:15:02,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (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-11-06 21:15:02,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:15:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:15:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:15:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:15:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:15:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-06 21:15:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2019-11-06 21:15:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-11-06 21:15:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2019-11-06 21:15:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2019-11-06 21:15:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:15:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:15:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:15:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:15:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:15:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:15:02,680 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:15:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:15:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:15:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:15:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:15:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:15:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:15:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:15:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:15:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:15:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:15:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:15:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:15:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:15:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:15:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:15:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:15:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:15:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:15:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:15:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:15:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:15:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:15:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:15:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:15:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:15:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:15:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:15:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:15:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:15:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:15:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:15:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:15:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:15:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:15:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:15:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:15:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:15:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:15:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:15:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:15:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:15:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:15:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:15:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:15:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:15:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:15:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:15:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:15:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:15:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:15:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:15:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:15:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:15:02,695 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:15:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:15:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:15:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:15:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:15:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:15:02,696 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:15:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-06 21:15:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:15:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:15:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2019-11-06 21:15:02,697 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-11-06 21:15:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:15:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2019-11-06 21:15:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2019-11-06 21:15:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:15:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:15:02,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:15:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 21:15:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:15:02,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:15:03,052 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:15:03,357 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:15:03,358 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-06 21:15:03,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:03 BoogieIcfgContainer [2019-11-06 21:15:03,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:15:03,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:15:03,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:15:03,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:15:03,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:01" (1/3) ... [2019-11-06 21:15:03,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53647b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:03, skipping insertion in model container [2019-11-06 21:15:03,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:02" (2/3) ... [2019-11-06 21:15:03,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53647b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:03, skipping insertion in model container [2019-11-06 21:15:03,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:03" (3/3) ... [2019-11-06 21:15:03,367 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2019-11-06 21:15:03,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:15:03,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:15:03,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:15:03,414 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:15:03,414 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:15:03,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:15:03,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:15:03,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:15:03,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:15:03,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:15:03,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:15:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-11-06 21:15:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 21:15:03,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:03,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:03,441 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash 881770505, now seen corresponding path program 1 times [2019-11-06 21:15:03,456 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:03,456 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759834902] [2019-11-06 21:15:03,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:03,631 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759834902] [2019-11-06 21:15:03,632 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:03,633 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:15:03,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840464049] [2019-11-06 21:15:03,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:15:03,642 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:15:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:15:03,661 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-11-06 21:15:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:03,901 INFO L93 Difference]: Finished difference Result 141 states and 202 transitions. [2019-11-06 21:15:03,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:15:03,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-06 21:15:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:03,914 INFO L225 Difference]: With dead ends: 141 [2019-11-06 21:15:03,914 INFO L226 Difference]: Without dead ends: 56 [2019-11-06 21:15:03,919 INFO L630 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-11-06 21:15:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-06 21:15:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-11-06 21:15:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:15:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-11-06 21:15:03,977 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2019-11-06 21:15:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:03,978 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-11-06 21:15:03,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:15:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-11-06 21:15:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 21:15:03,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:03,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:03,981 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash 857758959, now seen corresponding path program 1 times [2019-11-06 21:15:03,981 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:03,982 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81494183] [2019-11-06 21:15:03,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:04,090 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81494183] [2019-11-06 21:15:04,090 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:04,090 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:15:04,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021134328] [2019-11-06 21:15:04,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:04,095 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:04,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:04,095 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 4 states. [2019-11-06 21:15:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:04,241 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-11-06 21:15:04,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:04,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-06 21:15:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:04,244 INFO L225 Difference]: With dead ends: 80 [2019-11-06 21:15:04,244 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 21:15:04,245 INFO L630 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-11-06 21:15:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 21:15:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-11-06 21:15:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 21:15:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-06 21:15:04,267 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 11 [2019-11-06 21:15:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:04,267 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-06 21:15:04,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-11-06 21:15:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:15:04,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:04,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:04,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1045120254, now seen corresponding path program 1 times [2019-11-06 21:15:04,271 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:04,272 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896605293] [2019-11-06 21:15:04,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:15:04,407 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896605293] [2019-11-06 21:15:04,408 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:04,408 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:15:04,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581551958] [2019-11-06 21:15:04,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:15:04,409 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:15:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:15:04,409 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 5 states. [2019-11-06 21:15:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:04,621 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2019-11-06 21:15:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:04,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:15:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:04,624 INFO L225 Difference]: With dead ends: 83 [2019-11-06 21:15:04,626 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 21:15:04,626 INFO L630 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-11-06 21:15:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 21:15:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-11-06 21:15:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 21:15:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-11-06 21:15:04,642 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2019-11-06 21:15:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:04,642 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-11-06 21:15:04,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:15:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-11-06 21:15:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:15:04,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:04,649 INFO L410 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-11-06 21:15:04,650 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 685223862, now seen corresponding path program 1 times [2019-11-06 21:15:04,651 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:04,651 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098277084] [2019-11-06 21:15:04,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:04,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098277084] [2019-11-06 21:15:04,945 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:04,945 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:15:04,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348300249] [2019-11-06 21:15:04,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:15:04,946 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:15:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:15:04,947 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 11 states. [2019-11-06 21:15:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:05,372 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2019-11-06 21:15:05,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:15:05,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-06 21:15:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:05,374 INFO L225 Difference]: With dead ends: 130 [2019-11-06 21:15:05,375 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 21:15:05,376 INFO L630 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-11-06 21:15:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 21:15:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-11-06 21:15:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-06 21:15:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-06 21:15:05,393 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 38 [2019-11-06 21:15:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:05,393 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-06 21:15:05,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:15:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-06 21:15:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 21:15:05,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:05,397 INFO L410 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-11-06 21:15:05,397 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash -27576761, now seen corresponding path program 2 times [2019-11-06 21:15:05,398 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:05,398 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828745355] [2019-11-06 21:15:05,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:05,711 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828745355] [2019-11-06 21:15:05,712 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136128610] [2019-11-06 21:15:05,712 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-11-06 21:15:05,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-06 21:15:05,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:05,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:15:05,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:15:05,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:15:05,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 18 [2019-11-06 21:15:05,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802120330] [2019-11-06 21:15:05,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:05,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:05,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:05,922 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-11-06 21:15:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:05,987 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-11-06 21:15:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:05,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-06 21:15:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:05,989 INFO L225 Difference]: With dead ends: 95 [2019-11-06 21:15:05,989 INFO L226 Difference]: Without dead ends: 93 [2019-11-06 21:15:05,990 INFO L630 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-11-06 21:15:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-06 21:15:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2019-11-06 21:15:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-06 21:15:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-11-06 21:15:06,003 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 43 [2019-11-06 21:15:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:06,004 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-11-06 21:15:06,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-11-06 21:15:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-06 21:15:06,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:06,006 INFO L410 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-11-06 21:15:06,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:06,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:06,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1977264063, now seen corresponding path program 1 times [2019-11-06 21:15:06,215 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:06,215 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090088444] [2019-11-06 21:15:06,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:15:06,477 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090088444] [2019-11-06 21:15:06,477 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760317690] [2019-11-06 21:15:06,477 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-11-06 21:15:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:15:06,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:06,712 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:15:06,712 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 18 [2019-11-06 21:15:06,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095998722] [2019-11-06 21:15:06,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:15:06,713 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:06,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:15:06,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:06,714 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 10 states. [2019-11-06 21:15:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:06,936 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2019-11-06 21:15:06,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:15:06,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-06 21:15:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:06,938 INFO L225 Difference]: With dead ends: 159 [2019-11-06 21:15:06,938 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 21:15:06,945 INFO L630 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-11-06 21:15:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 21:15:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2019-11-06 21:15:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-06 21:15:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-11-06 21:15:06,962 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 54 [2019-11-06 21:15:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:06,963 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-06 21:15:06,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:15:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-11-06 21:15:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 21:15:06,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:06,967 INFO L410 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-11-06 21:15:07,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:07,177 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1552707912, now seen corresponding path program 1 times [2019-11-06 21:15:07,178 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:07,178 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326587433] [2019-11-06 21:15:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:07,414 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326587433] [2019-11-06 21:15:07,414 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673177783] [2019-11-06 21:15:07,414 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-11-06 21:15:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:15:07,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:07,629 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:07,630 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-11-06 21:15:07,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153400514] [2019-11-06 21:15:07,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:15:07,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:07,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:15:07,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:07,632 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 18 states. [2019-11-06 21:15:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:08,178 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2019-11-06 21:15:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:15:08,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-06 21:15:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:08,180 INFO L225 Difference]: With dead ends: 147 [2019-11-06 21:15:08,180 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 21:15:08,181 INFO L630 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-11-06 21:15:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 21:15:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-11-06 21:15:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 21:15:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2019-11-06 21:15:08,189 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 52 [2019-11-06 21:15:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:08,190 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2019-11-06 21:15:08,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:15:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2019-11-06 21:15:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-06 21:15:08,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:08,191 INFO L410 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-11-06 21:15:08,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:08,396 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash 184700400, now seen corresponding path program 2 times [2019-11-06 21:15:08,396 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:08,397 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047134745] [2019-11-06 21:15:08,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:09,397 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047134745] [2019-11-06 21:15:09,397 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306767348] [2019-11-06 21:15:09,397 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-11-06 21:15:09,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:09,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:09,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 21:15:09,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:09,648 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:09,648 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2019-11-06 21:15:09,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511966484] [2019-11-06 21:15:09,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 21:15:09,649 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:09,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 21:15:09,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:15:09,651 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 19 states. [2019-11-06 21:15:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:10,268 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2019-11-06 21:15:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 21:15:10,269 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-06 21:15:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:10,270 INFO L225 Difference]: With dead ends: 164 [2019-11-06 21:15:10,270 INFO L226 Difference]: Without dead ends: 90 [2019-11-06 21:15:10,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:15:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-06 21:15:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-11-06 21:15:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 21:15:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-11-06 21:15:10,283 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 55 [2019-11-06 21:15:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:10,283 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-11-06 21:15:10,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 21:15:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-11-06 21:15:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:15:10,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:10,285 INFO L410 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-11-06 21:15:10,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:10,490 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 664839096, now seen corresponding path program 3 times [2019-11-06 21:15:10,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:10,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581585143] [2019-11-06 21:15:10,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 21:15:10,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581585143] [2019-11-06 21:15:10,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855034315] [2019-11-06 21:15:10,603 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-11-06 21:15:10,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-06 21:15:10,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:10,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:15:10,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 21:15:10,765 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:10,765 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-06 21:15:10,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418675102] [2019-11-06 21:15:10,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:15:10,767 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:15:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:15:10,767 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 8 states. [2019-11-06 21:15:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:10,925 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2019-11-06 21:15:10,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:10,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-06 21:15:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:10,928 INFO L225 Difference]: With dead ends: 127 [2019-11-06 21:15:10,928 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 21:15:10,929 INFO L630 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-11-06 21:15:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 21:15:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2019-11-06 21:15:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-06 21:15:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2019-11-06 21:15:10,938 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 58 [2019-11-06 21:15:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:10,938 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2019-11-06 21:15:10,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:15:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2019-11-06 21:15:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-06 21:15:10,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:10,940 INFO L410 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-11-06 21:15:11,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:11,146 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1355298761, now seen corresponding path program 4 times [2019-11-06 21:15:11,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:11,148 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903310339] [2019-11-06 21:15:11,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:15:11,404 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903310339] [2019-11-06 21:15:11,404 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016636513] [2019-11-06 21:15:11,404 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-11-06 21:15:11,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:15:11,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:11,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-06 21:15:11,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:11,649 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:11,649 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2019-11-06 21:15:11,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959462116] [2019-11-06 21:15:11,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 21:15:11,650 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 21:15:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:15:11,651 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 21 states. [2019-11-06 21:15:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:12,477 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2019-11-06 21:15:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 21:15:12,477 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2019-11-06 21:15:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:12,480 INFO L225 Difference]: With dead ends: 182 [2019-11-06 21:15:12,480 INFO L226 Difference]: Without dead ends: 118 [2019-11-06 21:15:12,481 INFO L630 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-11-06 21:15:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-06 21:15:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-11-06 21:15:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-06 21:15:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-11-06 21:15:12,491 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 63 [2019-11-06 21:15:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:12,492 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-11-06 21:15:12,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 21:15:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-11-06 21:15:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 21:15:12,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:12,494 INFO L410 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-11-06 21:15:12,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:12,698 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1173831873, now seen corresponding path program 5 times [2019-11-06 21:15:12,698 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:12,699 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832839203] [2019-11-06 21:15:12,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 21:15:12,812 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832839203] [2019-11-06 21:15:12,812 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563945831] [2019-11-06 21:15:12,812 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-11-06 21:15:13,113 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-06 21:15:13,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:13,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 21:15:13,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:15:13,430 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:13,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 20 [2019-11-06 21:15:13,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844133177] [2019-11-06 21:15:13,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:15:13,434 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:15:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:13,435 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 20 states. [2019-11-06 21:15:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:14,260 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2019-11-06 21:15:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-06 21:15:14,261 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-11-06 21:15:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:14,262 INFO L225 Difference]: With dead ends: 186 [2019-11-06 21:15:14,263 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 21:15:14,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-11-06 21:15:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 21:15:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2019-11-06 21:15:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-06 21:15:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2019-11-06 21:15:14,275 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 66 [2019-11-06 21:15:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:14,276 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2019-11-06 21:15:14,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:15:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2019-11-06 21:15:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-06 21:15:14,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:14,277 INFO L410 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-11-06 21:15:14,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:14,486 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1522769064, now seen corresponding path program 6 times [2019-11-06 21:15:14,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:14,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824475750] [2019-11-06 21:15:14,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 21:15:15,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824475750] [2019-11-06 21:15:15,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879028140] [2019-11-06 21:15:15,375 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-11-06 21:15:15,537 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-06 21:15:15,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:15,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-06 21:15:15,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:15,580 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-11-06 21:15:15,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:15,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:15,953 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-11-06 21:15:15,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:15,971 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-11-06 21:15:15,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,039 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-11-06 21:15:16,040 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,064 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-11-06 21:15:16,064 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:16,119 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:67 [2019-11-06 21:15:16,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,356 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-11-06 21:15:16,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,371 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-11-06 21:15:16,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,443 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-11-06 21:15:16,444 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,454 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-11-06 21:15:16,456 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:16,502 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:79 [2019-11-06 21:15:16,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,625 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, v_prenex_3], 4=[v_prenex_2, |v_#memory_$Pointer$.base_32|]} [2019-11-06 21:15:16,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,658 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-11-06 21:15:16,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,749 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.2 percent of original size [2019-11-06 21:15:16,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,783 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-11-06 21:15:16,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,878 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.3 percent of original size [2019-11-06 21:15:16,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,944 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-11-06 21:15:16,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,946 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,069 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-06 21:15:17,069 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-11-06 21:15:17,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,127 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-11-06 21:15:17,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,130 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,264 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-06 21:15:17,265 INFO L567 ElimStorePlain]: treesize reduction 32, result has 78.5 percent of original size [2019-11-06 21:15:17,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:17,267 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:101, output treesize:151 [2019-11-06 21:15:17,443 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-06 21:15:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,470 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-11-06 21:15:17,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:17,476 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-11-06 21:15:17,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:17,482 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-11-06 21:15:17,482 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,485 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:15:17,486 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2019-11-06 21:15:17,499 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,505 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:15:17,506 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:17,549 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:332, output treesize:107 [2019-11-06 21:15:17,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:17,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,818 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-11-06 21:15:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,821 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:17,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:17,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:17,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,833 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-11-06 21:15:17,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:17,837 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:17,902 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.8 percent of original size [2019-11-06 21:15:17,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,931 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-11-06 21:15:17,932 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,952 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-11-06 21:15:17,953 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:17,963 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:169, output treesize:9 [2019-11-06 21:15:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-06 21:15:18,147 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:18,147 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 40 [2019-11-06 21:15:18,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944767508] [2019-11-06 21:15:18,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-06 21:15:18,148 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-06 21:15:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1467, Unknown=0, NotChecked=0, Total=1560 [2019-11-06 21:15:18,149 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand 40 states. [2019-11-06 21:15:19,424 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-06 21:15:19,716 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-11-06 21:15:20,639 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-11-06 21:15:20,917 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-11-06 21:15:21,623 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-11-06 21:15:21,901 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-11-06 21:15:22,153 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-11-06 21:15:22,513 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-11-06 21:15:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:23,711 INFO L93 Difference]: Finished difference Result 327 states and 462 transitions. [2019-11-06 21:15:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-06 21:15:23,712 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-11-06 21:15:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:23,716 INFO L225 Difference]: With dead ends: 327 [2019-11-06 21:15:23,716 INFO L226 Difference]: Without dead ends: 302 [2019-11-06 21:15:23,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=356, Invalid=4614, Unknown=0, NotChecked=0, Total=4970 [2019-11-06 21:15:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-06 21:15:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2019-11-06 21:15:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-06 21:15:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 271 transitions. [2019-11-06 21:15:23,754 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 271 transitions. Word has length 74 [2019-11-06 21:15:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:23,754 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 271 transitions. [2019-11-06 21:15:23,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-06 21:15:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 271 transitions. [2019-11-06 21:15:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-06 21:15:23,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:23,757 INFO L410 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-11-06 21:15:23,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:23,962 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash 977789968, now seen corresponding path program 1 times [2019-11-06 21:15:23,963 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:23,963 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798427700] [2019-11-06 21:15:23,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:15:26,048 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798427700] [2019-11-06 21:15:26,048 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843503099] [2019-11-06 21:15:26,048 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-11-06 21:15:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:26,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-06 21:15:26,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:26,271 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-11-06 21:15:26,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 21:15:26,393 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-11-06 21:15:26,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2019-11-06 21:15:26,962 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-11-06 21:15:26,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,982 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-11-06 21:15:26,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:75 [2019-11-06 21:15:27,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,279 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-11-06 21:15:27,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:44 [2019-11-06 21:15:27,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|], 4=[|v_#memory_$Pointer$.base_34|]} [2019-11-06 21:15:27,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:27,485 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-11-06 21:15:27,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:27,522 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-11-06 21:15:27,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,566 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-11-06 21:15:27,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:84 [2019-11-06 21:15:27,806 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_$Pointer$.base_35|]} [2019-11-06 21:15:27,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:27,817 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-11-06 21:15:27,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:27,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:27,878 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-11-06 21:15:27,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:27,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,943 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.9 percent of original size [2019-11-06 21:15:27,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:27,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:90 [2019-11-06 21:15:28,074 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_35|], 7=[|v_#memory_$Pointer$.base_36|]} [2019-11-06 21:15:28,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,124 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-11-06 21:15:28,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,202 INFO L567 ElimStorePlain]: treesize reduction 48, result has 65.0 percent of original size [2019-11-06 21:15:28,273 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 127 [2019-11-06 21:15:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:28,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,287 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:28,431 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-11-06 21:15:28,431 INFO L567 ElimStorePlain]: treesize reduction 80, result has 57.7 percent of original size [2019-11-06 21:15:28,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,433 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-11-06 21:15:28,433 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:146 [2019-11-06 21:15:28,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,035 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-11-06 21:15:29,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:29,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:29,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,243 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-11-06 21:15:29,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:29,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,262 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-11-06 21:15:29,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,307 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-11-06 21:15:29,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:158 [2019-11-06 21:15:29,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 21:15:30,102 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:30,102 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2019-11-06 21:15:30,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477530021] [2019-11-06 21:15:30,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-06 21:15:30,103 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-06 21:15:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2216, Unknown=0, NotChecked=0, Total=2352 [2019-11-06 21:15:30,107 INFO L87 Difference]: Start difference. First operand 203 states and 271 transitions. Second operand 49 states. [2019-11-06 21:15:34,141 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-11-06 21:15:34,818 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-06 21:15:37,281 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-06 21:15:38,201 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-06 21:15:38,457 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-06 21:15:39,810 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-06 21:15:40,417 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-11-06 21:15:42,424 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2019-11-06 21:15:43,188 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107