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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 12:51:37,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 12:51:37,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 12:51:37,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 12:51:37,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 12:51:37,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 12:51:37,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 12:51:37,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 12:51:37,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 12:51:37,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 12:51:37,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 12:51:37,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 12:51:37,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 12:51:37,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 12:51:37,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 12:51:37,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 12:51:37,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 12:51:37,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 12:51:37,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 12:51:37,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 12:51:37,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 12:51:37,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 12:51:37,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 12:51:37,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 12:51:37,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 12:51:37,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 12:51:37,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 12:51:37,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 12:51:37,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 12:51:37,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 12:51:37,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 12:51:37,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 12:51:37,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 12:51:37,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 12:51:37,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 12:51:37,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 12:51:37,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 12:51:37,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 12:51:37,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 12:51:37,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 12:51:37,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 12:51:37,369 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-07 12:51:37,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 12:51:37,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 12:51:37,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 12:51:37,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 12:51:37,398 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 12:51:37,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 12:51:37,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 12:51:37,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 12:51:37,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 12:51:37,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 12:51:37,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 12:51:37,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 12:51:37,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 12:51:37,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 12:51:37,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 12:51:37,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 12:51:37,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 12:51:37,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 12:51:37,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 12:51:37,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 12:51:37,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 12:51:37,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 12:51:37,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 12:51:37,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 12:51:37,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 12:51:37,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 12:51:37,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 12:51:37,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 12:51:37,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 12:51:37,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 12:51:37,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 12:51:37,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 12:51:37,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 12:51:37,754 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 12:51:37,755 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-10-07 12:51:37,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66127895/e9ebd409830e4273aaddcb8cd2e2c2ee/FLAGb3cfa1882 [2019-10-07 12:51:38,409 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 12:51:38,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2019-10-07 12:51:38,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66127895/e9ebd409830e4273aaddcb8cd2e2c2ee/FLAGb3cfa1882 [2019-10-07 12:51:38,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f66127895/e9ebd409830e4273aaddcb8cd2e2c2ee [2019-10-07 12:51:38,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 12:51:38,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 12:51:38,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 12:51:38,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 12:51:38,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 12:51:38,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:51:38" (1/1) ... [2019-10-07 12:51:38,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13db8748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:38, skipping insertion in model container [2019-10-07 12:51:38,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:51:38" (1/1) ... [2019-10-07 12:51:38,689 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 12:51:38,735 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 12:51:39,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:51:39,227 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 12:51:39,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:51:39,394 INFO L192 MainTranslator]: Completed translation [2019-10-07 12:51:39,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39 WrapperNode [2019-10-07 12:51:39,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 12:51:39,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 12:51:39,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 12:51:39,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 12:51:39,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (1/1) ... [2019-10-07 12:51:39,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 12:51:39,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 12:51:39,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 12:51:39,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 12:51:39,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (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-07 12:51:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 12:51:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 12:51:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 12:51:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 12:51:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-07 12:51:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2019-10-07 12:51:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-10-07 12:51:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-10-07 12:51:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-10-07 12:51:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-10-07 12:51:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-10-07 12:51:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-10-07 12:51:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2019-10-07 12:51:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2019-10-07 12:51:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-07 12:51:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2019-10-07 12:51:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2019-10-07 12:51:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2019-10-07 12:51:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-07 12:51:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-07 12:51:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-07 12:51:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-07 12:51:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-10-07 12:51:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 12:51:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 12:51:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 12:51:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 12:51:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 12:51:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 12:51:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 12:51:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 12:51:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 12:51:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 12:51:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 12:51:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 12:51:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 12:51:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 12:51:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 12:51:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 12:51:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 12:51:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 12:51:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 12:51:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 12:51:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 12:51:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 12:51:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 12:51:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 12:51:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 12:51:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 12:51:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 12:51:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 12:51:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 12:51:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 12:51:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 12:51:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 12:51:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 12:51:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 12:51:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 12:51:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 12:51:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 12:51:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 12:51:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 12:51:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 12:51:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 12:51:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 12:51:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 12:51:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 12:51:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 12:51:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 12:51:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 12:51:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 12:51:39,575 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 12:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 12:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 12:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 12:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 12:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 12:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 12:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 12:51:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 12:51:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 12:51:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 12:51:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 12:51:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 12:51:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-07 12:51:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 12:51:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2019-10-07 12:51:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-10-07 12:51:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 12:51:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-10-07 12:51:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-10-07 12:51:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-10-07 12:51:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 12:51:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-10-07 12:51:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-10-07 12:51:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2019-10-07 12:51:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2019-10-07 12:51:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-07 12:51:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2019-10-07 12:51:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2019-10-07 12:51:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2019-10-07 12:51:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 12:51:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-07 12:51:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-07 12:51:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-07 12:51:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-07 12:51:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-10-07 12:51:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 12:51:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 12:51:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 12:51:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 12:51:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 12:51:40,536 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 12:51:40,536 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-07 12:51:40,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:51:40 BoogieIcfgContainer [2019-10-07 12:51:40,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 12:51:40,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 12:51:40,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 12:51:40,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 12:51:40,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:51:38" (1/3) ... [2019-10-07 12:51:40,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338ba17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:51:40, skipping insertion in model container [2019-10-07 12:51:40,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:51:39" (2/3) ... [2019-10-07 12:51:40,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338ba17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:51:40, skipping insertion in model container [2019-10-07 12:51:40,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:51:40" (3/3) ... [2019-10-07 12:51:40,547 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2019-10-07 12:51:40,558 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 12:51:40,566 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-07 12:51:40,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-07 12:51:40,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 12:51:40,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 12:51:40,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 12:51:40,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 12:51:40,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 12:51:40,604 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 12:51:40,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 12:51:40,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 12:51:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-07 12:51:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 12:51:40,632 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:51:40,633 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:51:40,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:51:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:51:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 540850015, now seen corresponding path program 1 times [2019-10-07 12:51:40,651 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:51:40,651 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:40,651 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:40,652 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:51:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:51:40,903 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-07 12:51:40,908 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:40,908 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:51:40,909 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 12:51:40,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 12:51:40,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 12:51:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 12:51:40,932 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2019-10-07 12:51:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:51:41,021 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2019-10-07 12:51:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 12:51:41,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-07 12:51:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:51:41,041 INFO L225 Difference]: With dead ends: 176 [2019-10-07 12:51:41,042 INFO L226 Difference]: Without dead ends: 89 [2019-10-07 12:51:41,048 INFO L606 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-07 12:51:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-07 12:51:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-07 12:51:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-07 12:51:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-10-07 12:51:41,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 21 [2019-10-07 12:51:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:51:41,113 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-10-07 12:51:41,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 12:51:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-10-07 12:51:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 12:51:41,116 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:51:41,116 INFO L385 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] [2019-10-07 12:51:41,117 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:51:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:51:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash 339403675, now seen corresponding path program 1 times [2019-10-07 12:51:41,117 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:51:41,118 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:41,118 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:41,118 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:51:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:51:41,274 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-07 12:51:41,275 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:41,275 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:51:41,275 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 12:51:41,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 12:51:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 12:51:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 12:51:41,278 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 4 states. [2019-10-07 12:51:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:51:41,465 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2019-10-07 12:51:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 12:51:41,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-07 12:51:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:51:41,468 INFO L225 Difference]: With dead ends: 187 [2019-10-07 12:51:41,468 INFO L226 Difference]: Without dead ends: 112 [2019-10-07 12:51:41,470 INFO L606 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-07 12:51:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-07 12:51:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2019-10-07 12:51:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-07 12:51:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2019-10-07 12:51:41,487 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 22 [2019-10-07 12:51:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:51:41,487 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2019-10-07 12:51:41,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 12:51:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2019-10-07 12:51:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 12:51:41,488 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:51:41,489 INFO L385 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] [2019-10-07 12:51:41,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:51:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:51:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash 37085733, now seen corresponding path program 1 times [2019-10-07 12:51:41,490 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:51:41,490 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:41,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:41,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:41,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:51:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:51:41,708 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-07 12:51:41,708 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:41,708 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:51:41,709 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 12:51:41,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 12:51:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 12:51:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 12:51:41,712 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 8 states. [2019-10-07 12:51:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:51:42,197 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-10-07 12:51:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 12:51:42,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-07 12:51:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:51:42,201 INFO L225 Difference]: With dead ends: 112 [2019-10-07 12:51:42,201 INFO L226 Difference]: Without dead ends: 98 [2019-10-07 12:51:42,202 INFO L606 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-07 12:51:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-07 12:51:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2019-10-07 12:51:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-07 12:51:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-10-07 12:51:42,217 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 23 [2019-10-07 12:51:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:51:42,217 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-10-07 12:51:42,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 12:51:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-10-07 12:51:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 12:51:42,219 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:51:42,219 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:51:42,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:51:42,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:51:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2090735880, now seen corresponding path program 1 times [2019-10-07 12:51:42,220 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:51:42,221 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:42,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:42,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:51:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:51:42,946 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-07 12:51:43,248 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-07 12:51:43,433 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-07 12:51:43,433 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:43,433 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:51:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:51:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:51:43,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-07 12:51:43,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:51:43,715 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-07 12:51:43,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:51:43,753 INFO L567 ElimStorePlain]: treesize reduction 13, result has 72.9 percent of original size [2019-10-07 12:51:43,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:51:43,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2019-10-07 12:51:43,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:51:43,999 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_3|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_3|]} [2019-10-07 12:51:44,008 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-07 12:51:44,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:51:44,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:51:44,030 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-07 12:51:44,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:51:44,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:51:44,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 12:51:44,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:17 [2019-10-07 12:51:58,263 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-07 12:52:16,480 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-07 12:52:16,500 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.offset_BEFORE_CALL_6|], 18=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_2|]} [2019-10-07 12:52:16,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:52:16,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:52:16,703 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-10-07 12:52:16,704 INFO L341 Elim1Store]: treesize reduction 88, result has 60.2 percent of original size [2019-10-07 12:52:16,704 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-07 12:52:16,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:52:16,963 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-07 12:52:16,964 INFO L567 ElimStorePlain]: treesize reduction 56, result has 80.7 percent of original size [2019-10-07 12:52:16,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:52:16,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 12:52:17,365 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-10-07 12:52:17,366 INFO L341 Elim1Store]: treesize reduction 223, result has 39.7 percent of original size [2019-10-07 12:52:17,367 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-07 12:52:17,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 12:52:17,590 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-07 12:52:17,591 INFO L567 ElimStorePlain]: treesize reduction 94, result has 60.8 percent of original size [2019-10-07 12:52:17,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,665 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-07 12:52:17,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:260, output treesize:226 [2019-10-07 12:52:17,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:17,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:52:27,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:52:27,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:49,147 WARN L191 SmtUtils]: Spent 2.17 m on a formula simplification. DAG size of input: 243 DAG size of output: 122 [2019-10-07 12:54:51,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:54:51,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:54:51,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:01,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:01,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-07 12:55:05,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:55:05,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:58:50,878 WARN L191 SmtUtils]: Spent 3.67 m on a formula simplification. DAG size of input: 258 DAG size of output: 137 [2019-10-07 12:58:50,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 12:58:50,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-07 12:58:50,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-07 13:00:33,154 WARN L191 SmtUtils]: Spent 1.66 m on a formula simplification that was a NOOP. DAG size: 432 [2019-10-07 13:00:33,284 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-07 13:00:33,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:00:33,761 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-10-07 13:00:33,988 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-10-07 13:00:34,187 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-10-07 13:00:34,305 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-07 13:00:34,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:00:47,122 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-10-07 13:01:10,589 WARN L191 SmtUtils]: Spent 14.92 s on a formula simplification that was a NOOP. DAG size: 77 [2019-10-07 13:01:10,596 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-07 13:01:36,750 WARN L191 SmtUtils]: Spent 15.03 s on a formula simplification that was a NOOP. DAG size: 125 [2019-10-07 13:01:36,940 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-10-07 13:01:37,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:37,036 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-07 13:01:39,071 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (not (= |c_ldv_list_add_#in~head.base| |c_~#drvlist~0.base|))) (.cse7 (not (= |c_ldv_list_add_#in~head.offset| |c_~#drvlist~0.offset|)))) (and (or (forall ((v_prenex_60 Int)) (or (< |c_ldv_list_add_#in~new.base| v_prenex_60) (exists ((v_prenex_67 Int) (v_prenex_68 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (and (not (= (select (select (let ((.cse0 (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_~#drvlist~0.base|) |c_~#drvlist~0.offset|))) (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse2 (store (select |c_old(#memory_$Pointer$.base)| .cse2) (+ v_prenex_67 4) v_prenex_61)))) (store .cse1 v_prenex_61 (store (store (select .cse1 v_prenex_61) v_prenex_62 .cse2) (+ v_prenex_62 4) |c_~#drvlist~0.base|)))))) (store .cse0 |c_~#drvlist~0.base| (store (select .cse0 |c_~#drvlist~0.base|) v_prenex_68 v_prenex_61))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|)) (<= v_prenex_60 v_prenex_61))) (exists ((v_prenex_66 Int) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (and (not (= |c_~#mutexes~0.offset| (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (select (select |c_old(#memory_$Pointer$.base)| |c_~#drvlist~0.base|) |c_~#drvlist~0.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse5 (store (select |c_old(#memory_$Pointer$.offset)| .cse5) (+ v_prenex_63 4) v_prenex_66))))) (store .cse4 v_prenex_64 (store (store (select .cse4 v_prenex_64) v_prenex_66 v_prenex_63) (+ v_prenex_66 4) v_prenex_65))))) (store .cse3 |c_~#drvlist~0.base| (store (select .cse3 |c_~#drvlist~0.base|) v_prenex_65 v_prenex_66))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (<= v_prenex_60 v_prenex_64))))) .cse6 .cse7 (forall ((v___ldv_list_add_~new.offset_12 Int) (v___ldv_list_add_~new.base_12 Int) (v___ldv_list_add_~prev.offset_12 Int) (v___ldv_list_add_~next.offset_12 Int)) (or (< v___ldv_list_add_~new.base_12 c_ldv_list_add_~new.base) (= |c_~#mutexes~0.base| (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ldv_list_add_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ldv_list_add_#t~mem6.base|) (+ v___ldv_list_add_~next.offset_12 4) v___ldv_list_add_~new.base_12)))) (store .cse9 v___ldv_list_add_~new.base_12 (store (store (select .cse9 v___ldv_list_add_~new.base_12) v___ldv_list_add_~new.offset_12 |c_ldv_list_add_#t~mem6.base|) (+ v___ldv_list_add_~new.offset_12 4) c_ldv_list_add_~head.base))))) (store .cse8 c_ldv_list_add_~head.base (store (select .cse8 c_ldv_list_add_~head.base) v___ldv_list_add_~prev.offset_12 v___ldv_list_add_~new.base_12))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))))) (or .cse6 .cse7 (forall ((v___ldv_list_add_~new.offset_12 Int) (v___ldv_list_add_~new.base_12 Int) (v___ldv_list_add_~prev.offset_12 Int) (v___ldv_list_add_~next.offset_12 Int)) (or (< v___ldv_list_add_~new.base_12 c_ldv_list_add_~new.base) (= |c_~#mutexes~0.offset| (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ldv_list_add_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ldv_list_add_#t~mem6.base|) (+ v___ldv_list_add_~next.offset_12 4) v___ldv_list_add_~new.offset_12)))) (store .cse11 v___ldv_list_add_~new.base_12 (store (store (select .cse11 v___ldv_list_add_~new.base_12) v___ldv_list_add_~new.offset_12 v___ldv_list_add_~next.offset_12) (+ v___ldv_list_add_~new.offset_12 4) v___ldv_list_add_~prev.offset_12))))) (store .cse10 c_ldv_list_add_~head.base (store (select .cse10 c_ldv_list_add_~head.base) v___ldv_list_add_~prev.offset_12 v___ldv_list_add_~new.offset_12))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)))) (forall ((v_foo_~me~0.base_BEFORE_CALL_2 Int)) (or (exists ((v_prenex_59 Int) (v_prenex_56 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (and (not (= |c_~#mutexes~0.offset| (select (select (let ((.cse12 (let ((.cse13 (let ((.cse14 (select (select |c_old(#memory_$Pointer$.base)| |c_~#drvlist~0.base|) |c_~#drvlist~0.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse14 (store (select |c_old(#memory_$Pointer$.offset)| .cse14) (+ v_prenex_59 4) v_prenex_57))))) (store .cse13 v_prenex_56 (store (store (select .cse13 v_prenex_56) v_prenex_57 v_prenex_59) (+ v_prenex_57 4) v_prenex_58))))) (store .cse12 |c_~#drvlist~0.base| (store (select .cse12 |c_~#drvlist~0.base|) v_prenex_58 v_prenex_57))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (<= v_foo_~me~0.base_BEFORE_CALL_2 v_prenex_56))) (exists ((v___ldv_list_add_~new.base_9 Int) (v___ldv_list_add_~new.offset_9 Int) (v___ldv_list_add_~prev.offset_9 Int) (v___ldv_list_add_~next.offset_9 Int)) (and (not (= (select (select (let ((.cse15 (let ((.cse17 (select (select |c_old(#memory_$Pointer$.base)| |c_~#drvlist~0.base|) |c_~#drvlist~0.offset|))) (let ((.cse16 (store |c_old(#memory_$Pointer$.base)| .cse17 (store (select |c_old(#memory_$Pointer$.base)| .cse17) (+ v___ldv_list_add_~next.offset_9 4) v___ldv_list_add_~new.base_9)))) (store .cse16 v___ldv_list_add_~new.base_9 (store (store (select .cse16 v___ldv_list_add_~new.base_9) v___ldv_list_add_~new.offset_9 .cse17) (+ v___ldv_list_add_~new.offset_9 4) |c_~#drvlist~0.base|)))))) (store .cse15 |c_~#drvlist~0.base| (store (select .cse15 |c_~#drvlist~0.base|) v___ldv_list_add_~prev.offset_9 v___ldv_list_add_~new.base_9))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|)) (<= v_foo_~me~0.base_BEFORE_CALL_2 v___ldv_list_add_~new.base_9))) (< |c_ldv_list_add_#in~new.base| v_foo_~me~0.base_BEFORE_CALL_2)))))) is different from true [2019-10-07 13:01:39,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:01:39,153 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 169