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/ldv-sets/test_mutex_unbounded-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:20:59,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:20:59,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:20:59,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:20:59,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:20:59,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:20:59,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:20:59,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:20:59,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:20:59,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:20:59,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:20:59,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:20:59,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:20:59,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:20:59,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:20:59,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:20:59,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:20:59,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:20:59,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:20:59,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:20:59,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:20:59,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:20:59,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:20:59,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:20:59,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:20:59,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:20:59,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:20:59,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:20:59,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:20:59,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:20:59,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:20:59,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:20:59,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:20:59,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:20:59,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:20:59,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:20:59,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:20:59,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:20:59,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:20:59,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:20:59,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:20:59,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:20:59,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:20:59,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:20:59,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:20:59,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:20:59,989 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:20:59,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:20:59,989 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:20:59,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:20:59,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:20:59,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:20:59,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:20:59,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:20:59,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:20:59,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:20:59,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:20:59,992 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:20:59,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:20:59,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:20:59,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:20:59,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:20:59,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:20:59,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:20:59,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:20:59,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:20:59,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:20:59,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:20:59,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:20:59,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:20:59,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:21:00,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:21:00,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:21:00,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:21:00,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:21:00,060 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:21:00,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-2.i [2019-10-02 10:21:00,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829caa607/4ab28979562c45eca724d63358ad2825/FLAG9d55fa208 [2019-10-02 10:21:00,688 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:21:00,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-2.i [2019-10-02 10:21:00,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829caa607/4ab28979562c45eca724d63358ad2825/FLAG9d55fa208 [2019-10-02 10:21:00,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829caa607/4ab28979562c45eca724d63358ad2825 [2019-10-02 10:21:00,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:21:00,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:21:00,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:21:00,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:21:00,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:21:00,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:21:00" (1/1) ... [2019-10-02 10:21:00,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f27e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:00, skipping insertion in model container [2019-10-02 10:21:00,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:21:00" (1/1) ... [2019-10-02 10:21:00,948 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:21:01,008 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:21:01,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:21:01,560 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:21:01,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:21:01,753 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:21:01,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01 WrapperNode [2019-10-02 10:21:01,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:21:01,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:21:01,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:21:01,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:21:01,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... [2019-10-02 10:21:01,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:21:01,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:21:01,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:21:01,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:21:01,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:21:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:21:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:21:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:21:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:21:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 10:21:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-10-02 10:21:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-10-02 10:21:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-10-02 10:21:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-10-02 10:21:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-10-02 10:21:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-10-02 10:21:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-10-02 10:21:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-10-02 10:21:01,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-10-02 10:21:01,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-02 10:21:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-10-02 10:21:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-10-02 10:21:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-10-02 10:21:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 10:21:01,901 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 10:21:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 10:21:01,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 10:21:01,904 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-10-02 10:21:01,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:21:01,905 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:21:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:21:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:21:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:21:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:21:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:21:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:21:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:21:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:21:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:21:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:21:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:21:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:21:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:21:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:21:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:21:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:21:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:21:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:21:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:21:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:21:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:21:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:21:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:21:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:21:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:21:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:21:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:21:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:21:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:21:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:21:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:21:01,915 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:21:01,915 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:21:01,916 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:21:01,916 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:21:01,916 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:21:01,916 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:21:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:21:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:21:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:21:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:21:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:21:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:21:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:21:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:21:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:21:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:21:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:21:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:21:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:21:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:21:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:21:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:21:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:21:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:21:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:21:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:21:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:21:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:21:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:21:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:21:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:21:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:21:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:21:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:21:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:21:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:21:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:21:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:21:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:21:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:21:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:21:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 10:21:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:21:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 10:21:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 10:21:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:21:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-10-02 10:21:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-10-02 10:21:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-10-02 10:21:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-10-02 10:21:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-10-02 10:21:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-02 10:21:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-10-02 10:21:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-10-02 10:21:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-10-02 10:21:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:21:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:21:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 10:21:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 10:21:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:21:02,669 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:21:02,670 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-02 10:21:02,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:21:02 BoogieIcfgContainer [2019-10-02 10:21:02,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:21:02,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:21:02,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:21:02,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:21:02,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:21:00" (1/3) ... [2019-10-02 10:21:02,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f56a45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:21:02, skipping insertion in model container [2019-10-02 10:21:02,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:21:01" (2/3) ... [2019-10-02 10:21:02,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f56a45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:21:02, skipping insertion in model container [2019-10-02 10:21:02,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:21:02" (3/3) ... [2019-10-02 10:21:02,690 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2019-10-02 10:21:02,702 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:21:02,715 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-02 10:21:02,732 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-02 10:21:02,757 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:21:02,758 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:21:02,758 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:21:02,758 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:21:02,758 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:21:02,759 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:21:02,759 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:21:02,759 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:21:02,759 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:21:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-10-02 10:21:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 10:21:02,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:21:02,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:21:02,808 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:21:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:21:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1077103690, now seen corresponding path program 1 times [2019-10-02 10:21:02,816 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:21:02,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:21:02,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:02,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:21:02,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:21:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:21:03,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:21:03,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:21:03,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:21:03,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:21:03,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:21:03,037 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-10-02 10:21:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:21:03,075 INFO L93 Difference]: Finished difference Result 201 states and 245 transitions. [2019-10-02 10:21:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:21:03,077 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-10-02 10:21:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:21:03,088 INFO L225 Difference]: With dead ends: 201 [2019-10-02 10:21:03,088 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 10:21:03,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:21:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 10:21:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-10-02 10:21:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 10:21:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-02 10:21:03,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 24 [2019-10-02 10:21:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:21:03,146 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-02 10:21:03,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:21:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-02 10:21:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 10:21:03,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:21:03,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:21:03,149 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:21:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:21:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1362205908, now seen corresponding path program 1 times [2019-10-02 10:21:03,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:21:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:21:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:21:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:21:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:21:03,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:21:03,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:21:03,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:21:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:21:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:21:03,247 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 4 states. [2019-10-02 10:21:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:21:03,279 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2019-10-02 10:21:03,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:21:03,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-02 10:21:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:21:03,284 INFO L225 Difference]: With dead ends: 105 [2019-10-02 10:21:03,284 INFO L226 Difference]: Without dead ends: 103 [2019-10-02 10:21:03,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:21:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-02 10:21:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-02 10:21:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 10:21:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2019-10-02 10:21:03,302 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 24 [2019-10-02 10:21:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:21:03,303 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2019-10-02 10:21:03,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:21:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2019-10-02 10:21:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 10:21:03,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:21:03,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:21:03,305 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:21:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:21:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash 212397397, now seen corresponding path program 1 times [2019-10-02 10:21:03,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:21:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:21:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:03,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:21:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:21:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:21:03,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:21:03,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:21:03,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:21:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:21:03,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:21:03,435 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 4 states. [2019-10-02 10:21:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:21:03,646 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2019-10-02 10:21:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:21:03,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-02 10:21:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:21:03,649 INFO L225 Difference]: With dead ends: 218 [2019-10-02 10:21:03,649 INFO L226 Difference]: Without dead ends: 131 [2019-10-02 10:21:03,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:21:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-02 10:21:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2019-10-02 10:21:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-02 10:21:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2019-10-02 10:21:03,667 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 24 [2019-10-02 10:21:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:21:03,668 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2019-10-02 10:21:03,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:21:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2019-10-02 10:21:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 10:21:03,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:21:03,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:21:03,670 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:21:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:21:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash -452485887, now seen corresponding path program 1 times [2019-10-02 10:21:03,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:21:03,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:21:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:21:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:21:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:21:03,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:21:03,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 10:21:03,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:21:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:21:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:21:03,883 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 8 states. [2019-10-02 10:21:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:21:04,310 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-10-02 10:21:04,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 10:21:04,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-02 10:21:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:21:04,313 INFO L225 Difference]: With dead ends: 131 [2019-10-02 10:21:04,313 INFO L226 Difference]: Without dead ends: 113 [2019-10-02 10:21:04,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:21:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-02 10:21:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2019-10-02 10:21:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-02 10:21:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2019-10-02 10:21:04,342 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 28 [2019-10-02 10:21:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:21:04,346 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2019-10-02 10:21:04,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:21:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2019-10-02 10:21:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 10:21:04,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:21:04,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:21:04,349 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:21:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:21:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1784659630, now seen corresponding path program 1 times [2019-10-02 10:21:04,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:21:04,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:21:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:04,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:21:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:21:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:21:05,181 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-02 10:21:05,426 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-02 10:21:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:21:05,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:21:05,558 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:21:05,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:21:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:21:05,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-02 10:21:05,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:21:05,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-10-02 10:21:05,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:21:05,845 INFO L567 ElimStorePlain]: treesize reduction 13, result has 72.9 percent of original size [2019-10-02 10:21:05,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:21:05,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2019-10-02 10:21:05,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:06,067 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_3|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_3|]} [2019-10-02 10:21:06,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-02 10:21:06,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:21:06,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:21:06,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 10:21:06,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:21:06,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:21:06,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:21:06,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:17 [2019-10-02 10:21:20,309 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 10:21:38,519 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-02 10:21:38,547 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_BEFORE_CALL_6|], 18=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_2|]} [2019-10-02 10:21:38,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:21:38,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:21:38,744 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-10-02 10:21:38,744 INFO L341 Elim1Store]: treesize reduction 88, result has 60.2 percent of original size [2019-10-02 10:21:38,745 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 3 case distinctions, treesize of input 117 treesize of output 150 [2019-10-02 10:21:38,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:21:39,018 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-02 10:21:39,019 INFO L567 ElimStorePlain]: treesize reduction 56, result has 80.7 percent of original size [2019-10-02 10:21:39,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:21:39,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:21:39,430 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-10-02 10:21:39,431 INFO L341 Elim1Store]: treesize reduction 223, result has 39.7 percent of original size [2019-10-02 10:21:39,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 193 [2019-10-02 10:21:39,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:21:39,636 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-02 10:21:39,636 INFO L567 ElimStorePlain]: treesize reduction 94, result has 60.8 percent of original size [2019-10-02 10:21:39,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 10:21:39,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:260, output treesize:226 [2019-10-02 10:21:39,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:39,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:39,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:49,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:49,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:21:58,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:21:58,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:18,914 WARN L191 SmtUtils]: Spent 2.14 m on a formula simplification. DAG size of input: 243 DAG size of output: 122 [2019-10-02 10:24:22,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:22,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:22,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:32,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:32,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:24:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:24:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:18,599 WARN L191 SmtUtils]: Spent 3.67 m on a formula simplification. DAG size of input: 258 DAG size of output: 137 [2019-10-02 10:28:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:28:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 10:28:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 10:30:02,008 WARN L191 SmtUtils]: Spent 1.68 m on a formula simplification that was a NOOP. DAG size: 432 [2019-10-02 10:30:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:30:02,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:30:02,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-10-02 10:30:02,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 10:30:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 10:30:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=498, Unknown=20, NotChecked=0, Total=600 [2019-10-02 10:30:02,158 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 25 states. [2019-10-02 10:31:58,176 WARN L191 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-10-02 10:32:19,410 WARN L191 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-10-02 10:33:01,242 WARN L191 SmtUtils]: Spent 31.44 s on a formula simplification that was a NOOP. DAG size: 127 [2019-10-02 10:33:33,325 WARN L191 SmtUtils]: Spent 31.92 s on a formula simplification that was a NOOP. DAG size: 132