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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:52:37,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:52:37,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:52:37,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:52:37,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:52:37,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:52:37,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:52:37,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:52:37,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:52:37,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:52:37,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:52:37,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:52:37,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:52:37,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:52:37,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:52:37,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:52:37,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:52:37,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:52:37,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:52:37,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:52:37,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:52:37,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:52:37,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:52:37,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:52:37,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:52:37,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:52:37,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:52:37,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:52:37,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:52:37,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:52:37,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:52:37,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:52:37,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:52:37,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:52:37,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:52:37,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:52:37,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:52:37,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:52:37,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:52:37,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:52:37,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:52:37,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:52:37,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:52:37,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:52:37,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:52:37,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:52:37,163 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:52:37,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:52:37,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:52:37,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:52:37,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:52:37,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:52:37,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:52:37,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:52:37,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:52:37,165 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:52:37,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:52:37,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:52:37,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:52:37,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:52:37,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:52:37,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:52:37,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:52:37,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:52:37,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:52:37,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:52:37,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:52:37,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:52:37,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:52:37,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:52:37,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:52:37,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:52:37,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:52:37,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:52:37,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:52:37,218 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:52:37,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2019-09-08 01:52:37,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25838bf9d/2452b6f2347c42d6ad44e341aef9e6b8/FLAGcfaf9c063 [2019-09-08 01:52:37,771 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:52:37,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2019-09-08 01:52:37,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25838bf9d/2452b6f2347c42d6ad44e341aef9e6b8/FLAGcfaf9c063 [2019-09-08 01:52:38,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25838bf9d/2452b6f2347c42d6ad44e341aef9e6b8 [2019-09-08 01:52:38,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:52:38,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:52:38,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:52:38,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:52:38,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:52:38,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f10b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38, skipping insertion in model container [2019-09-08 01:52:38,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,142 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:52:38,203 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:52:38,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:52:38,700 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:52:38,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:52:38,841 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:52:38,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38 WrapperNode [2019-09-08 01:52:38,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:52:38,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:52:38,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:52:38,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:52:38,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... [2019-09-08 01:52:38,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:52:38,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:52:38,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:52:38,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:52:38,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:52:38,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:52:38,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:52:38,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 01:52:38,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-09-08 01:52:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-09-08 01:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-09-08 01:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-09-08 01:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-09-08 01:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-09-08 01:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-09-08 01:52:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-09-08 01:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-09-08 01:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 01:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-08 01:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-08 01:52:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 01:52:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-09-08 01:52:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 01:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 01:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 01:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 01:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 01:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 01:52:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 01:52:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 01:52:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 01:52:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 01:52:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 01:52:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 01:52:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 01:52:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 01:52:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 01:52:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 01:52:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 01:52:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 01:52:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 01:52:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 01:52:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 01:52:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 01:52:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 01:52:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 01:52:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 01:52:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 01:52:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 01:52:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 01:52:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 01:52:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 01:52:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 01:52:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 01:52:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 01:52:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 01:52:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 01:52:38,998 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 01:52:38,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 01:52:39,000 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 01:52:39,000 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 01:52:39,000 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 01:52:39,000 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 01:52:39,000 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 01:52:39,000 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 01:52:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 01:52:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 01:52:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 01:52:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 01:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 01:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 01:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 01:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 01:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:52:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-09-08 01:52:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-09-08 01:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-09-08 01:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-09-08 01:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-09-08 01:52:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-09-08 01:52:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:52:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:52:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:52:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 01:52:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:52:39,653 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:52:39,653 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-08 01:52:39,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:52:39 BoogieIcfgContainer [2019-09-08 01:52:39,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:52:39,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:52:39,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:52:39,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:52:39,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:52:38" (1/3) ... [2019-09-08 01:52:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30815c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:52:39, skipping insertion in model container [2019-09-08 01:52:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:52:38" (2/3) ... [2019-09-08 01:52:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30815c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:52:39, skipping insertion in model container [2019-09-08 01:52:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:52:39" (3/3) ... [2019-09-08 01:52:39,663 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2019-09-08 01:52:39,673 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:52:39,682 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-08 01:52:39,700 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-08 01:52:39,736 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:52:39,737 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:52:39,737 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:52:39,737 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:52:39,737 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:52:39,738 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:52:39,738 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:52:39,738 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:52:39,738 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:52:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-09-08 01:52:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:52:39,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:52:39,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:52:39,783 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:52:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:52:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1377823641, now seen corresponding path program 1 times [2019-09-08 01:52:39,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:52:39,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:52:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:39,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:52:39,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:52:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:52:40,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:52:40,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:52:40,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:52:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:52:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:52:40,036 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-09-08 01:52:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:52:40,070 INFO L93 Difference]: Finished difference Result 199 states and 241 transitions. [2019-09-08 01:52:40,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:52:40,072 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-09-08 01:52:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:52:40,084 INFO L225 Difference]: With dead ends: 199 [2019-09-08 01:52:40,084 INFO L226 Difference]: Without dead ends: 98 [2019-09-08 01:52:40,092 INFO L628 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-09-08 01:52:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-08 01:52:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-09-08 01:52:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 01:52:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-09-08 01:52:40,168 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 24 [2019-09-08 01:52:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:52:40,169 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-09-08 01:52:40,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:52:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-09-08 01:52:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:52:40,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:52:40,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:52:40,174 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:52:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:52:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1092721423, now seen corresponding path program 1 times [2019-09-08 01:52:40,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:52:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:52:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:40,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:52:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:52:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:52:40,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:52:40,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:52:40,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:52:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:52:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:52:40,309 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2019-09-08 01:52:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:52:40,341 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2019-09-08 01:52:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:52:40,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-08 01:52:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:52:40,348 INFO L225 Difference]: With dead ends: 104 [2019-09-08 01:52:40,348 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 01:52:40,349 INFO L628 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-09-08 01:52:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 01:52:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-08 01:52:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-08 01:52:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-09-08 01:52:40,364 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 24 [2019-09-08 01:52:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:52:40,365 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-09-08 01:52:40,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:52:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-09-08 01:52:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:52:40,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:52:40,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:52:40,367 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:52:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:52:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1627642568, now seen corresponding path program 1 times [2019-09-08 01:52:40,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:52:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:52:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:40,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:52:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:52:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:52:40,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:52:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 01:52:40,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:52:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:52:40,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:52:40,516 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 4 states. [2019-09-08 01:52:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:52:40,698 INFO L93 Difference]: Finished difference Result 216 states and 243 transitions. [2019-09-08 01:52:40,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:52:40,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-08 01:52:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:52:40,701 INFO L225 Difference]: With dead ends: 216 [2019-09-08 01:52:40,702 INFO L226 Difference]: Without dead ends: 130 [2019-09-08 01:52:40,703 INFO L628 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-09-08 01:52:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-08 01:52:40,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2019-09-08 01:52:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 01:52:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-09-08 01:52:40,718 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 24 [2019-09-08 01:52:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:52:40,719 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-09-08 01:52:40,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:52:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-09-08 01:52:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:52:40,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:52:40,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:52:40,721 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:52:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:52:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1843559385, now seen corresponding path program 1 times [2019-09-08 01:52:40,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:52:40,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:52:40,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:40,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:52:40,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:52:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:52:40,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:52:40,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 01:52:40,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:52:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:52:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:52:40,901 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 8 states. [2019-09-08 01:52:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:52:41,305 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-09-08 01:52:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:52:41,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-08 01:52:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:52:41,308 INFO L225 Difference]: With dead ends: 130 [2019-09-08 01:52:41,308 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 01:52:41,309 INFO L628 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-09-08 01:52:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 01:52:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-09-08 01:52:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 01:52:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-09-08 01:52:41,323 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 28 [2019-09-08 01:52:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:52:41,324 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-09-08 01:52:41,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:52:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-09-08 01:52:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:52:41,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:52:41,326 INFO L399 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-09-08 01:52:41,326 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:52:41,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:52:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash 472914007, now seen corresponding path program 1 times [2019-09-08 01:52:41,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:52:41,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:52:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:41,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:52:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:52:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:52:41,958 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-08 01:52:42,190 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-08 01:52:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:52:42,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:52:42,330 INFO L223 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) [2019-09-08 01:52:42,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:52:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:52:42,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:52:42,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:52:42,505 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-09-08 01:52:42,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:52:42,563 INFO L567 ElimStorePlain]: treesize reduction 13, result has 72.9 percent of original size [2019-09-08 01:52:42,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:52:42,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2019-09-08 01:52:42,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:52:42,804 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_3|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_3|]} [2019-09-08 01:52:42,809 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-09-08 01:52:42,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:52:42,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:52:42,833 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-09-08 01:52:42,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:52:42,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:52:42,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:52:42,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:17 [2019-09-08 01:52:57,130 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-08 01:53:15,316 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-08 01:53:15,339 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_BEFORE_CALL_6|], 18=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_2|]} [2019-09-08 01:53:15,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:53:15,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:53:15,536 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 01:53:15,536 INFO L341 Elim1Store]: treesize reduction 88, result has 60.2 percent of original size [2019-09-08 01:53:15,537 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-09-08 01:53:15,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:53:15,779 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 01:53:15,779 INFO L567 ElimStorePlain]: treesize reduction 56, result has 80.7 percent of original size [2019-09-08 01:53:15,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:53:15,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 01:53:16,153 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-09-08 01:53:16,154 INFO L341 Elim1Store]: treesize reduction 223, result has 39.7 percent of original size [2019-09-08 01:53:16,155 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-09-08 01:53:16,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:53:16,350 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 01:53:16,351 INFO L567 ElimStorePlain]: treesize reduction 94, result has 60.8 percent of original size [2019-09-08 01:53:16,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,441 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-09-08 01:53:16,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:260, output treesize:226 [2019-09-08 01:53:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:16,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:16,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:25,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:25,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:53:26,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:26,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:53:26,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:42,603 WARN L188 SmtUtils]: Spent 2.08 m on a formula simplification. DAG size of input: 243 DAG size of output: 122 [2019-09-08 01:55:45,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:45,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 01:55:51,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:55:51,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:59:34,931 WARN L188 SmtUtils]: Spent 3.67 m on a formula simplification. DAG size of input: 258 DAG size of output: 137 [2019-09-08 01:59:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:59:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-08 01:59:34,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-08 02:01:09,790 WARN L188 SmtUtils]: Spent 1.54 m on a formula simplification that was a NOOP. DAG size: 432 [2019-09-08 02:01:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:01:09,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:01:09,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-08 02:01:09,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 02:01:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 02:01:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=498, Unknown=21, NotChecked=0, Total=600 [2019-09-08 02:01:09,910 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 25 states. [2019-09-08 02:03:05,793 WARN L188 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-09-08 02:03:27,091 WARN L188 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-09-08 02:04:16,024 WARN L188 SmtUtils]: Spent 38.60 s on a formula simplification that was a NOOP. DAG size: 127 [2019-09-08 02:04:50,070 WARN L188 SmtUtils]: Spent 33.95 s on a formula simplification that was a NOOP. DAG size: 132 [2019-09-08 02:07:11,240 WARN L188 SmtUtils]: Spent 2.34 m on a formula simplification. DAG size of input: 150 DAG size of output: 142